./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:40:38,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:40:38,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:40:38,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:40:38,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:40:38,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:40:38,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:40:38,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:40:38,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:40:38,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:40:38,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:40:38,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:40:38,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:40:38,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:40:38,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:40:38,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:40:38,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:40:38,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:40:38,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:40:38,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:40:38,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:40:38,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:40:38,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:40:38,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:40:38,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:40:38,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:40:38,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:40:38,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:40:38,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:40:38,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:40:38,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:40:38,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:40:38,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:40:38,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:40:38,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:40:38,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:40:38,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:40:38,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:40:38,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:40:38,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:40:38,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:40:38,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:40:38,617 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-10-14 10:40:38,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:40:38,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:40:38,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:40:38,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:40:38,914 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:40:38,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:40:40,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:40:40,678 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:40:40,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:40:40,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d781051f/5c71b86c15524a8d95f015bd80202128/FLAG549c491a6 [2024-10-14 10:40:40,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d781051f/5c71b86c15524a8d95f015bd80202128 [2024-10-14 10:40:40,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:40:40,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:40:40,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:40:40,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:40:40,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:40:40,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:40:40" (1/1) ... [2024-10-14 10:40:40,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c460fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:40, skipping insertion in model container [2024-10-14 10:40:40,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:40:40" (1/1) ... [2024-10-14 10:40:40,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:40:40,895 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-10-14 10:40:40,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:40:40,965 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:40:40,978 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-10-14 10:40:41,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:40:41,058 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:40:41,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41 WrapperNode [2024-10-14 10:40:41,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:40:41,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:40:41,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:40:41,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:40:41,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,119 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-14 10:40:41,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:40:41,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:40:41,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:40:41,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:40:41,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:40:41,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:40:41,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:40:41,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:40:41,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:40:41,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (1/1) ... [2024-10-14 10:40:41,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:40:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:40:41,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:40:41,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:40:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:40:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:40:41,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:40:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:40:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:40:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:40:41,391 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:40:41,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:40:41,763 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 10:40:41,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:40:41,806 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:40:41,806 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:40:41,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:40:41 BoogieIcfgContainer [2024-10-14 10:40:41,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:40:41,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:40:41,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:40:41,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:40:41,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:40:40" (1/3) ... [2024-10-14 10:40:41,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a27841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:40:41, skipping insertion in model container [2024-10-14 10:40:41,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:41" (2/3) ... [2024-10-14 10:40:41,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a27841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:40:41, skipping insertion in model container [2024-10-14 10:40:41,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:40:41" (3/3) ... [2024-10-14 10:40:41,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:40:41,844 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:40:41,844 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:40:41,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:40:41,921 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@476b1536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:40:41,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:40:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:40:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 10:40:41,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:41,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:41,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1325358340, now seen corresponding path program 1 times [2024-10-14 10:40:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:41,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533694648] [2024-10-14 10:40:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533694648] [2024-10-14 10:40:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533694648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:40:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480106160] [2024-10-14 10:40:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:42,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:40:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:40:42,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:40:42,495 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:40:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:42,543 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-10-14 10:40:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:40:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-10-14 10:40:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:42,557 INFO L225 Difference]: With dead ends: 127 [2024-10-14 10:40:42,558 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 10:40:42,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:40:42,569 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:42,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:40:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 10:40:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 10:40:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:40:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 98 transitions. [2024-10-14 10:40:42,619 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 98 transitions. Word has length 101 [2024-10-14 10:40:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:42,620 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 98 transitions. [2024-10-14 10:40:42,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:40:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2024-10-14 10:40:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 10:40:42,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:42,625 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:42,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:40:42,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:42,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash -653956102, now seen corresponding path program 1 times [2024-10-14 10:40:42,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:42,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091688237] [2024-10-14 10:40:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091688237] [2024-10-14 10:40:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091688237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:40:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444643079] [2024-10-14 10:40:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:40:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:40:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,179 INFO L87 Difference]: Start difference. First operand 63 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:43,282 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2024-10-14 10:40:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:40:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-10-14 10:40:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:43,286 INFO L225 Difference]: With dead ends: 187 [2024-10-14 10:40:43,286 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 10:40:43,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,288 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:43,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:40:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 10:40:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-14 10:40:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:40:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-10-14 10:40:43,329 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 101 [2024-10-14 10:40:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-10-14 10:40:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-10-14 10:40:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 10:40:43,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:43,336 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:40:43,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 381006951, now seen corresponding path program 1 times [2024-10-14 10:40:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201474350] [2024-10-14 10:40:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201474350] [2024-10-14 10:40:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201474350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:40:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808300648] [2024-10-14 10:40:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:43,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:40:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:40:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,552 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:43,658 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-14 10:40:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:40:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-10-14 10:40:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:43,665 INFO L225 Difference]: With dead ends: 359 [2024-10-14 10:40:43,665 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 10:40:43,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,669 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:43,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 244 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:40:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 10:40:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-14 10:40:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.423529411764706) internal successors, (242), 170 states have internal predecessors, (242), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:40:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2024-10-14 10:40:43,724 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 102 [2024-10-14 10:40:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:43,726 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2024-10-14 10:40:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2024-10-14 10:40:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 10:40:43,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:43,728 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:43,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:40:43,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:43,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -483673139, now seen corresponding path program 1 times [2024-10-14 10:40:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529600133] [2024-10-14 10:40:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529600133] [2024-10-14 10:40:43,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529600133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:43,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:43,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:40:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648322663] [2024-10-14 10:40:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:43,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:40:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:40:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,869 INFO L87 Difference]: Start difference. First operand 235 states and 362 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:43,925 INFO L93 Difference]: Finished difference Result 579 states and 888 transitions. [2024-10-14 10:40:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:40:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-10-14 10:40:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:43,929 INFO L225 Difference]: With dead ends: 579 [2024-10-14 10:40:43,929 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 10:40:43,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:43,933 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:43,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 206 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:40:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 10:40:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 271. [2024-10-14 10:40:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 206 states have internal predecessors, (294), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:40:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2024-10-14 10:40:43,992 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 102 [2024-10-14 10:40:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:43,993 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2024-10-14 10:40:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2024-10-14 10:40:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 10:40:43,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:43,999 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:43,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:40:43,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:44,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 249922612, now seen corresponding path program 1 times [2024-10-14 10:40:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601454499] [2024-10-14 10:40:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 10:40:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601454499] [2024-10-14 10:40:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601454499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:40:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625306137] [2024-10-14 10:40:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:40:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:40:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:40:44,925 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:45,692 INFO L93 Difference]: Finished difference Result 827 states and 1218 transitions. [2024-10-14 10:40:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 10:40:45,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-14 10:40:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:45,700 INFO L225 Difference]: With dead ends: 827 [2024-10-14 10:40:45,700 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 10:40:45,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:40:45,704 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 213 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:45,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 330 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:40:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 10:40:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 481. [2024-10-14 10:40:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 384 states have (on average 1.421875) internal successors, (546), 388 states have internal predecessors, (546), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 10:40:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 714 transitions. [2024-10-14 10:40:45,781 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 714 transitions. Word has length 103 [2024-10-14 10:40:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:45,781 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 714 transitions. [2024-10-14 10:40:45,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 714 transitions. [2024-10-14 10:40:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 10:40:45,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:45,785 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:40:45,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -771145742, now seen corresponding path program 1 times [2024-10-14 10:40:45,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387568117] [2024-10-14 10:40:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387568117] [2024-10-14 10:40:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387568117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:40:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336614862] [2024-10-14 10:40:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:40:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:40:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:46,032 INFO L87 Difference]: Start difference. First operand 481 states and 714 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:46,162 INFO L93 Difference]: Finished difference Result 1109 states and 1648 transitions. [2024-10-14 10:40:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:40:46,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-14 10:40:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:46,169 INFO L225 Difference]: With dead ends: 1109 [2024-10-14 10:40:46,169 INFO L226 Difference]: Without dead ends: 629 [2024-10-14 10:40:46,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:40:46,172 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:46,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 200 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:40:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-14 10:40:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2024-10-14 10:40:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 496 states have (on average 1.4153225806451613) internal successors, (702), 500 states have internal predecessors, (702), 114 states have call successors, (114), 16 states have call predecessors, (114), 16 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-14 10:40:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 930 transitions. [2024-10-14 10:40:46,246 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 930 transitions. Word has length 103 [2024-10-14 10:40:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:46,246 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 930 transitions. [2024-10-14 10:40:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 930 transitions. [2024-10-14 10:40:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 10:40:46,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:46,248 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:46,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:40:46,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:46,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1098001482, now seen corresponding path program 1 times [2024-10-14 10:40:46,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226805314] [2024-10-14 10:40:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:46,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226805314] [2024-10-14 10:40:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226805314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:40:46,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066250625] [2024-10-14 10:40:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:40:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:40:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:40:46,487 INFO L87 Difference]: Start difference. First operand 627 states and 930 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:46,789 INFO L93 Difference]: Finished difference Result 1577 states and 2347 transitions. [2024-10-14 10:40:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:40:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-14 10:40:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:46,801 INFO L225 Difference]: With dead ends: 1577 [2024-10-14 10:40:46,802 INFO L226 Difference]: Without dead ends: 1263 [2024-10-14 10:40:46,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:40:46,804 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:46,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:40:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-14 10:40:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1249. [2024-10-14 10:40:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 988 states have (on average 1.417004048582996) internal successors, (1400), 996 states have internal predecessors, (1400), 228 states have call successors, (228), 32 states have call predecessors, (228), 32 states have return successors, (228), 220 states have call predecessors, (228), 228 states have call successors, (228) [2024-10-14 10:40:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1856 transitions. [2024-10-14 10:40:46,969 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1856 transitions. Word has length 103 [2024-10-14 10:40:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1856 transitions. [2024-10-14 10:40:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1856 transitions. [2024-10-14 10:40:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 10:40:46,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:46,972 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:46,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:40:46,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:46,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1177414852, now seen corresponding path program 1 times [2024-10-14 10:40:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097405938] [2024-10-14 10:40:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:47,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097405938] [2024-10-14 10:40:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097405938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 10:40:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027624095] [2024-10-14 10:40:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:47,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:40:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:40:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:40:47,328 INFO L87 Difference]: Start difference. First operand 1249 states and 1856 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:40:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:47,940 INFO L93 Difference]: Finished difference Result 2703 states and 4005 transitions. [2024-10-14 10:40:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:40:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-14 10:40:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:47,952 INFO L225 Difference]: With dead ends: 2703 [2024-10-14 10:40:47,952 INFO L226 Difference]: Without dead ends: 1455 [2024-10-14 10:40:47,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:40:47,957 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:47,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:40:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-14 10:40:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1433. [2024-10-14 10:40:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1124 states have (on average 1.4092526690391458) internal successors, (1584), 1134 states have internal predecessors, (1584), 270 states have call successors, (270), 38 states have call predecessors, (270), 38 states have return successors, (270), 260 states have call predecessors, (270), 270 states have call successors, (270) [2024-10-14 10:40:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2124 transitions. [2024-10-14 10:40:48,124 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2124 transitions. Word has length 104 [2024-10-14 10:40:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:48,125 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2124 transitions. [2024-10-14 10:40:48,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:40:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2124 transitions. [2024-10-14 10:40:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 10:40:48,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:48,127 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:40:48,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 601749154, now seen corresponding path program 1 times [2024-10-14 10:40:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813202113] [2024-10-14 10:40:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 10:40:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813202113] [2024-10-14 10:40:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813202113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:40:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226272914] [2024-10-14 10:40:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:40:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:40:48,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:40:48,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:40:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:49,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 10:40:49,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:40:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-14 10:40:49,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:40:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 10:40:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226272914] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:40:51,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:40:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-10-14 10:40:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566503743] [2024-10-14 10:40:51,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:40:51,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 10:40:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 10:40:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 10:40:51,140 INFO L87 Difference]: Start difference. First operand 1433 states and 2124 transitions. Second operand has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-14 10:40:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:52,794 INFO L93 Difference]: Finished difference Result 2403 states and 3449 transitions. [2024-10-14 10:40:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 10:40:52,795 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 104 [2024-10-14 10:40:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:52,803 INFO L225 Difference]: With dead ends: 2403 [2024-10-14 10:40:52,803 INFO L226 Difference]: Without dead ends: 1263 [2024-10-14 10:40:52,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1097, Invalid=2563, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 10:40:52,810 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 945 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:52,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 392 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:40:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-14 10:40:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 513. [2024-10-14 10:40:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 392 states have (on average 1.3341836734693877) internal successors, (523), 392 states have internal predecessors, (523), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 10:40:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 703 transitions. [2024-10-14 10:40:52,949 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 703 transitions. Word has length 104 [2024-10-14 10:40:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 703 transitions. [2024-10-14 10:40:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-14 10:40:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 703 transitions. [2024-10-14 10:40:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 10:40:52,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:52,950 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:52,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:40:53,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:40:53,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:53,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1001916593, now seen corresponding path program 1 times [2024-10-14 10:40:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660401413] [2024-10-14 10:40:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:40:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:40:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:40:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:40:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:40:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:40:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:40:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:40:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:40:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:40:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:40:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:40:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:40:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:40:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:40:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:40:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:40:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:40:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660401413] [2024-10-14 10:40:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660401413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:40:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:40:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:40:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545370326] [2024-10-14 10:40:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:40:53,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:40:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:40:53,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:40:53,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:40:53,396 INFO L87 Difference]: Start difference. First operand 513 states and 703 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:40:53,762 INFO L93 Difference]: Finished difference Result 1322 states and 1839 transitions. [2024-10-14 10:40:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:40:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-14 10:40:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:40:53,769 INFO L225 Difference]: With dead ends: 1322 [2024-10-14 10:40:53,769 INFO L226 Difference]: Without dead ends: 1063 [2024-10-14 10:40:53,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:40:53,771 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 168 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:40:53,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 351 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:40:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-14 10:40:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 933. [2024-10-14 10:40:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 732 states have (on average 1.3538251366120218) internal successors, (991), 732 states have internal predecessors, (991), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-14 10:40:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1291 transitions. [2024-10-14 10:40:53,960 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1291 transitions. Word has length 104 [2024-10-14 10:40:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:40:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1291 transitions. [2024-10-14 10:40:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:40:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1291 transitions. [2024-10-14 10:40:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 10:40:53,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:40:53,963 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:53,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 10:40:53,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:40:53,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:40:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -831236233, now seen corresponding path program 1 times [2024-10-14 10:40:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:40:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682623950] [2024-10-14 10:40:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:40:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:40:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837727268] [2024-10-14 10:40:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:40:54,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:40:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:40:54,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:40:54,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:40:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:40:54,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:40:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:40:54,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:40:54,239 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:40:54,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:40:54,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:40:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 10:40:54,446 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:40:54,535 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:40:54,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:40:54 BoogieIcfgContainer [2024-10-14 10:40:54,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:40:54,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:40:54,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:40:54,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:40:54,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:40:41" (3/4) ... [2024-10-14 10:40:54,543 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:40:54,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:40:54,545 INFO L158 Benchmark]: Toolchain (without parser) took 13836.35ms. Allocated memory was 157.3MB in the beginning and 390.1MB in the end (delta: 232.8MB). Free memory was 107.9MB in the beginning and 207.4MB in the end (delta: -99.4MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,545 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:40:54,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.04ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 93.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.71ms. Allocated memory is still 157.3MB. Free memory was 93.3MB in the beginning and 89.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,545 INFO L158 Benchmark]: Boogie Preprocessor took 87.29ms. Allocated memory is still 157.3MB. Free memory was 89.8MB in the beginning and 84.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,546 INFO L158 Benchmark]: RCFGBuilder took 598.52ms. Allocated memory is still 157.3MB. Free memory was 84.2MB in the beginning and 59.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,546 INFO L158 Benchmark]: TraceAbstraction took 12726.06ms. Allocated memory was 157.3MB in the beginning and 390.1MB in the end (delta: 232.8MB). Free memory was 58.4MB in the beginning and 208.4MB in the end (delta: -150.1MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,546 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 390.1MB. Free memory was 208.4MB in the beginning and 207.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:40:54,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.04ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 93.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.71ms. Allocated memory is still 157.3MB. Free memory was 93.3MB in the beginning and 89.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.29ms. Allocated memory is still 157.3MB. Free memory was 89.8MB in the beginning and 84.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 598.52ms. Allocated memory is still 157.3MB. Free memory was 84.2MB in the beginning and 59.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12726.06ms. Allocated memory was 157.3MB in the beginning and 390.1MB in the end (delta: 232.8MB). Free memory was 58.4MB in the beginning and 208.4MB in the end (delta: -150.1MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 390.1MB. Free memory was 208.4MB in the beginning and 207.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1989 mSDsluCounter, 2803 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1770 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 1033 mSDtfsCounter, 1385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1433occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1072 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 5673 SizeOfPredicates, 6 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4959/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 10:40:54,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:40:56,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:40:57,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:40:57,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:40:57,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:40:57,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:40:57,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:40:57,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:40:57,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:40:57,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:40:57,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:40:57,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:40:57,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:40:57,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:40:57,051 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:40:57,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:40:57,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:40:57,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:40:57,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:40:57,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:40:57,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:40:57,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:40:57,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:40:57,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:40:57,055 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:40:57,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:40:57,056 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:40:57,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:40:57,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:40:57,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:40:57,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:40:57,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:40:57,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:40:57,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:40:57,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:40:57,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:40:57,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:40:57,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:40:57,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:40:57,062 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:40:57,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:40:57,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:40:57,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:40:57,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:40:57,063 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:40:57,063 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-10-14 10:40:57,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:40:57,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:40:57,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:40:57,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:40:57,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:40:57,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:40:58,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:40:59,226 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:40:59,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:40:59,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a778bd/a2875f81d9644bc08799fa7cc7d59e58/FLAG32d6cf498 [2024-10-14 10:40:59,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a778bd/a2875f81d9644bc08799fa7cc7d59e58 [2024-10-14 10:40:59,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:40:59,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:40:59,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:40:59,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:40:59,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:40:59,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e16af9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59, skipping insertion in model container [2024-10-14 10:40:59,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:40:59,496 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-10-14 10:40:59,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:40:59,599 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:40:59,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-10-14 10:40:59,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:40:59,653 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:40:59,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59 WrapperNode [2024-10-14 10:40:59,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:40:59,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:40:59,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:40:59,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:40:59,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,711 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-14 10:40:59,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:40:59,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:40:59,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:40:59,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:40:59,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:40:59,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:40:59,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:40:59,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:40:59,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:40:59,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (1/1) ... [2024-10-14 10:40:59,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:40:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:40:59,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:40:59,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:40:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:40:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:40:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:40:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:40:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:40:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:40:59,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:40:59,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:41:14,596 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:41:14,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:41:14,660 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:41:14,661 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:41:14,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:41:14 BoogieIcfgContainer [2024-10-14 10:41:14,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:41:14,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:41:14,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:41:14,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:41:14,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:40:59" (1/3) ... [2024-10-14 10:41:14,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8cb8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:41:14, skipping insertion in model container [2024-10-14 10:41:14,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:40:59" (2/3) ... [2024-10-14 10:41:14,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8cb8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:41:14, skipping insertion in model container [2024-10-14 10:41:14,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:41:14" (3/3) ... [2024-10-14 10:41:14,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-14 10:41:14,694 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:41:14,695 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:41:14,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:41:14,787 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@256d8a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:41:14,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:41:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:41:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 10:41:14,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:41:14,805 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:41:14,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:41:14,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:41:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash 879549835, now seen corresponding path program 1 times [2024-10-14 10:41:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:41:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170907070] [2024-10-14 10:41:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:41:14,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:41:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:41:14,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:41:14,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:41:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:41:15,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:41:15,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:41:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-14 10:41:15,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:41:15,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:41:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170907070] [2024-10-14 10:41:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170907070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:41:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:41:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:41:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186370163] [2024-10-14 10:41:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:41:15,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:41:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:41:15,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:41:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:41:15,923 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:41:20,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:41:20,265 INFO L93 Difference]: Finished difference Result 105 states and 185 transitions. [2024-10-14 10:41:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:41:20,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-14 10:41:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:41:20,393 INFO L225 Difference]: With dead ends: 105 [2024-10-14 10:41:20,394 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 10:41:20,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:41:20,405 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:41:20,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 10:41:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 10:41:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 10:41:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:41:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-14 10:41:20,441 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 98 [2024-10-14 10:41:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:41:20,441 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-14 10:41:20,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:41:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-14 10:41:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 10:41:20,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:41:20,446 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:41:20,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:41:20,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:41:20,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:41:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:41:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1867586227, now seen corresponding path program 1 times [2024-10-14 10:41:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:41:20,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678458274] [2024-10-14 10:41:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:41:20,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:41:20,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:41:20,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:41:20,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:41:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:41:21,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:41:21,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:41:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:41:24,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:41:24,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:41:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678458274] [2024-10-14 10:41:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678458274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:41:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:41:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:41:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924102353] [2024-10-14 10:41:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:41:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:41:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:41:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:41:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:41:24,548 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:41:27,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:31,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:35,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:39,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:43,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:45,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:49,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:53,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:41:57,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:42:01,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:42:05,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:42:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:42:05,896 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2024-10-14 10:42:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:42:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-14 10:42:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:42:05,899 INFO L225 Difference]: With dead ends: 154 [2024-10-14 10:42:05,899 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 10:42:05,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:42:05,901 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:42:05,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 227 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 6 Unknown, 0 Unchecked, 41.2s Time] [2024-10-14 10:42:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 10:42:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-14 10:42:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:42:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-10-14 10:42:05,926 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 98 [2024-10-14 10:42:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:42:05,927 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-10-14 10:42:05,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 10:42:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-10-14 10:42:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 10:42:05,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:42:05,931 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:42:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:42:06,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:42:06,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:42:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:42:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1794343179, now seen corresponding path program 1 times [2024-10-14 10:42:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:42:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773043817] [2024-10-14 10:42:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:42:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:42:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:42:06,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:42:06,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:42:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:42:07,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:42:07,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:42:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:42:07,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:42:07,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:42:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773043817] [2024-10-14 10:42:07,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773043817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:42:07,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:42:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:42:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038849017] [2024-10-14 10:42:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:42:07,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:42:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:42:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:42:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:42:07,256 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)