./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:13:46,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:13:46,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:13:46,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:13:46,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:13:46,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:13:46,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:13:46,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:13:46,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:13:46,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:13:46,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:13:46,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:13:46,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:13:46,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:13:46,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:13:46,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:13:46,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:13:46,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:13:46,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:13:46,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:13:46,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:13:46,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:13:46,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:13:46,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:13:46,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:13:46,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:13:46,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:13:46,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:13:46,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:13:46,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:13:46,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:13:46,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:13:46,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:13:46,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:13:46,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:13:46,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:13:46,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:13:46,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:13:46,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:13:46,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:13:46,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:13:46,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:13:46,744 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-13 03:13:46,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:13:46,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:13:46,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:13:46,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:13:46,977 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:13:46,978 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-13 03:13:48,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:13:48,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:13:48,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-13 03:13:48,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf629536/71cfd59cb44c40cbbc70e38562cb23ee/FLAG2bdb3c78d [2024-10-13 03:13:48,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf629536/71cfd59cb44c40cbbc70e38562cb23ee [2024-10-13 03:13:48,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:13:48,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:13:48,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:13:48,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:13:48,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:13:48,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4537e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48, skipping insertion in model container [2024-10-13 03:13:48,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:13:48,513 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-13 03:13:48,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:13:48,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:13:48,625 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-13 03:13:48,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:13:48,667 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:13:48,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48 WrapperNode [2024-10-13 03:13:48,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:13:48,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:13:48,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:13:48,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:13:48,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,710 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-13 03:13:48,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:13:48,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:13:48,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:13:48,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:13:48,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,741 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-13 03:13:48,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:13:48,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:13:48,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:13:48,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:13:48,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (1/1) ... [2024-10-13 03:13:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:13:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:13:48,799 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-13 03:13:48,801 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-13 03:13:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:13:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:13:48,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:13:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:13:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:13:48,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:13:48,891 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:13:48,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:13:49,165 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:13:49,165 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:13:49,206 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:13:49,206 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:13:49,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:13:49 BoogieIcfgContainer [2024-10-13 03:13:49,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:13:49,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:13:49,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:13:49,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:13:49,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:13:48" (1/3) ... [2024-10-13 03:13:49,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d0235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:13:49, skipping insertion in model container [2024-10-13 03:13:49,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:13:48" (2/3) ... [2024-10-13 03:13:49,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d0235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:13:49, skipping insertion in model container [2024-10-13 03:13:49,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:13:49" (3/3) ... [2024-10-13 03:13:49,213 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-13 03:13:49,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:13:49,226 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:13:49,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:13:49,272 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;@609525f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:13:49,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:13:49,276 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-13 03:13:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:13:49,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:49,284 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-13 03:13:49,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:49,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1325358340, now seen corresponding path program 1 times [2024-10-13 03:13:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223407593] [2024-10-13 03:13:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,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-13 03:13:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223407593] [2024-10-13 03:13:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223407593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:13:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387404645] [2024-10-13 03:13:49,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:49,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:13:49,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:13:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:13:49,578 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-13 03:13:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:49,606 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-10-13 03:13:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:13:49,609 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-13 03:13:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:49,615 INFO L225 Difference]: With dead ends: 127 [2024-10-13 03:13:49,615 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 03:13:49,617 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-13 03:13:49,620 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-13 03:13:49,620 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-13 03:13:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 03:13:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 03:13:49,647 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-13 03:13:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 98 transitions. [2024-10-13 03:13:49,650 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 98 transitions. Word has length 101 [2024-10-13 03:13:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:49,650 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 98 transitions. [2024-10-13 03:13:49,650 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-13 03:13:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2024-10-13 03:13:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:13:49,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:49,653 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-13 03:13:49,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:13:49,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash -653956102, now seen corresponding path program 1 times [2024-10-13 03:13:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117229287] [2024-10-13 03:13:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,033 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-13 03:13:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117229287] [2024-10-13 03:13:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117229287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:13:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887784722] [2024-10-13 03:13:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:50,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:13:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:13:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:13:50,039 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-13 03:13:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:50,114 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2024-10-13 03:13:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:13:50,114 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-13 03:13:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:50,118 INFO L225 Difference]: With dead ends: 187 [2024-10-13 03:13:50,118 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 03:13:50,119 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-13 03:13:50,120 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 03:13:50,121 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-13 03:13:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 03:13:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-13 03:13:50,145 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-13 03:13:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-10-13 03:13:50,149 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 101 [2024-10-13 03:13:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:50,149 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-10-13 03:13:50,149 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-13 03:13:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-10-13 03:13:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 03:13:50,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:50,151 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-13 03:13:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:13:50,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:50,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash 381006951, now seen corresponding path program 1 times [2024-10-13 03:13:50,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070793705] [2024-10-13 03:13:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,293 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-13 03:13:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070793705] [2024-10-13 03:13:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070793705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:13:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025498013] [2024-10-13 03:13:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:50,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:13:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:13:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:13:50,299 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-13 03:13:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:50,381 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-13 03:13:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:13:50,382 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-13 03:13:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:50,385 INFO L225 Difference]: With dead ends: 359 [2024-10-13 03:13:50,387 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 03:13:50,388 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-13 03:13:50,389 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 03:13:50,391 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-13 03:13:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 03:13:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-13 03:13:50,431 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-13 03:13:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2024-10-13 03:13:50,435 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 102 [2024-10-13 03:13:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:50,436 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2024-10-13 03:13:50,437 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-13 03:13:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2024-10-13 03:13:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 03:13:50,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:50,440 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-13 03:13:50,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:13:50,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:50,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -483673139, now seen corresponding path program 1 times [2024-10-13 03:13:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890119658] [2024-10-13 03:13:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:50,557 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-13 03:13:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890119658] [2024-10-13 03:13:50,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890119658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:50,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:50,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:13:50,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983303018] [2024-10-13 03:13:50,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:50,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:13:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:13:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:13:50,560 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-13 03:13:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:50,611 INFO L93 Difference]: Finished difference Result 579 states and 888 transitions. [2024-10-13 03:13:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:13:50,612 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-13 03:13:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:50,617 INFO L225 Difference]: With dead ends: 579 [2024-10-13 03:13:50,618 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 03:13:50,619 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-13 03:13:50,621 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-13 03:13:50,621 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-13 03:13:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 03:13:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 271. [2024-10-13 03:13:50,665 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-13 03:13:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2024-10-13 03:13:50,669 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 102 [2024-10-13 03:13:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2024-10-13 03:13:50,670 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-13 03:13:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2024-10-13 03:13:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:13:50,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:50,675 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-13 03:13:50,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:13:50,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash 249922612, now seen corresponding path program 1 times [2024-10-13 03:13:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239483558] [2024-10-13 03:13:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,221 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-13 03:13:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239483558] [2024-10-13 03:13:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239483558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:13:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095158484] [2024-10-13 03:13:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:13:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:13:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:13:51,225 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-13 03:13:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:51,764 INFO L93 Difference]: Finished difference Result 827 states and 1218 transitions. [2024-10-13 03:13:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 03:13:51,765 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-13 03:13:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:51,769 INFO L225 Difference]: With dead ends: 827 [2024-10-13 03:13:51,769 INFO L226 Difference]: Without dead ends: 557 [2024-10-13 03:13:51,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-13 03:13:51,771 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 213 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:51,771 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.3s Time] [2024-10-13 03:13:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-13 03:13:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 481. [2024-10-13 03:13:51,805 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-13 03:13:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 714 transitions. [2024-10-13 03:13:51,808 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 714 transitions. Word has length 103 [2024-10-13 03:13:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:51,809 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 714 transitions. [2024-10-13 03:13:51,809 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-13 03:13:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 714 transitions. [2024-10-13 03:13:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:13:51,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:51,811 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-13 03:13:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:13:51,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:51,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -771145742, now seen corresponding path program 1 times [2024-10-13 03:13:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793127239] [2024-10-13 03:13:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:51,947 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-13 03:13:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793127239] [2024-10-13 03:13:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793127239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:13:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977175319] [2024-10-13 03:13:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:13:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:51,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:13:51,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:13:51,949 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-13 03:13:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:52,019 INFO L93 Difference]: Finished difference Result 1109 states and 1648 transitions. [2024-10-13 03:13:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:13:52,020 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-13 03:13:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:52,023 INFO L225 Difference]: With dead ends: 1109 [2024-10-13 03:13:52,024 INFO L226 Difference]: Without dead ends: 629 [2024-10-13 03:13:52,025 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-13 03:13:52,025 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:52,026 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.0s Time] [2024-10-13 03:13:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-13 03:13:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2024-10-13 03:13:52,059 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-13 03:13:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 930 transitions. [2024-10-13 03:13:52,062 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 930 transitions. Word has length 103 [2024-10-13 03:13:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:52,062 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 930 transitions. [2024-10-13 03:13:52,062 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-13 03:13:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 930 transitions. [2024-10-13 03:13:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:13:52,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:52,063 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-13 03:13:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:13:52,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1098001482, now seen corresponding path program 1 times [2024-10-13 03:13:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83716974] [2024-10-13 03:13:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,215 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-13 03:13:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83716974] [2024-10-13 03:13:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83716974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:13:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201236350] [2024-10-13 03:13:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:13:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:13:52,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:13:52,217 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-13 03:13:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:52,424 INFO L93 Difference]: Finished difference Result 1577 states and 2347 transitions. [2024-10-13 03:13:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:13:52,424 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-13 03:13:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:52,430 INFO L225 Difference]: With dead ends: 1577 [2024-10-13 03:13:52,430 INFO L226 Difference]: Without dead ends: 1263 [2024-10-13 03:13:52,432 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-13 03:13:52,432 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:52,433 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.1s Time] [2024-10-13 03:13:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-13 03:13:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1249. [2024-10-13 03:13:52,513 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-13 03:13:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1856 transitions. [2024-10-13 03:13:52,520 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1856 transitions. Word has length 103 [2024-10-13 03:13:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:52,520 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1856 transitions. [2024-10-13 03:13:52,521 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-13 03:13:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1856 transitions. [2024-10-13 03:13:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 03:13:52,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:52,522 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-13 03:13:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:13:52,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:52,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1177414852, now seen corresponding path program 1 times [2024-10-13 03:13:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639695459] [2024-10-13 03:13:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:52,765 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-13 03:13:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639695459] [2024-10-13 03:13:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639695459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:52,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:13:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815453240] [2024-10-13 03:13:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:52,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:13:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:13:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:13:52,767 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-13 03:13:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:53,178 INFO L93 Difference]: Finished difference Result 2703 states and 4005 transitions. [2024-10-13 03:13:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:13:53,179 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-13 03:13:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:53,185 INFO L225 Difference]: With dead ends: 2703 [2024-10-13 03:13:53,185 INFO L226 Difference]: Without dead ends: 1455 [2024-10-13 03:13:53,188 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-13 03:13:53,189 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:53,189 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.3s Time] [2024-10-13 03:13:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-13 03:13:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1433. [2024-10-13 03:13:53,267 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-13 03:13:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2124 transitions. [2024-10-13 03:13:53,292 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2124 transitions. Word has length 104 [2024-10-13 03:13:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:53,292 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2124 transitions. [2024-10-13 03:13:53,292 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-13 03:13:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2124 transitions. [2024-10-13 03:13:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 03:13:53,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:53,295 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-13 03:13:53,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:13:53,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash 601749154, now seen corresponding path program 1 times [2024-10-13 03:13:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002821471] [2024-10-13 03:13:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:53,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,834 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-13 03:13:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002821471] [2024-10-13 03:13:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002821471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:13:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120223143] [2024-10-13 03:13:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:53,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:13:53,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:13:53,837 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-13 03:13:53,839 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-13 03:13:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:53,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 03:13:53,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:13:54,645 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-13 03:13:54,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:13:55,532 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-13 03:13:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120223143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:13:55,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:13:55,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-10-13 03:13:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032601713] [2024-10-13 03:13:55,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:13:55,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 03:13:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 03:13:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 03:13:55,536 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-13 03:13:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:56,682 INFO L93 Difference]: Finished difference Result 2403 states and 3449 transitions. [2024-10-13 03:13:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 03:13:56,683 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-13 03:13:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:56,688 INFO L225 Difference]: With dead ends: 2403 [2024-10-13 03:13:56,688 INFO L226 Difference]: Without dead ends: 1263 [2024-10-13 03:13:56,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1097, Invalid=2563, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 03:13:56,693 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 945 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:56,693 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.4s Time] [2024-10-13 03:13:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-13 03:13:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 513. [2024-10-13 03:13:56,742 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-13 03:13:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 703 transitions. [2024-10-13 03:13:56,745 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 703 transitions. Word has length 104 [2024-10-13 03:13:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:56,745 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 703 transitions. [2024-10-13 03:13:56,745 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-13 03:13:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 703 transitions. [2024-10-13 03:13:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 03:13:56,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:56,746 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-13 03:13:56,760 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-13 03:13:56,947 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-13 03:13:56,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1001916593, now seen corresponding path program 1 times [2024-10-13 03:13:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852411955] [2024-10-13 03:13:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:13:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:13:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:13:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:13:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:13:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:13:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:13:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:13:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:13:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:13:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:13:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:13:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:13:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:13:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:13:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:13:57,091 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-13 03:13:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:13:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852411955] [2024-10-13 03:13:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852411955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:13:57,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:13:57,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:13:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648503845] [2024-10-13 03:13:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:13:57,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:13:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:13:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:13:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:13:57,093 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-13 03:13:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:13:57,328 INFO L93 Difference]: Finished difference Result 1322 states and 1839 transitions. [2024-10-13 03:13:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:13:57,329 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-13 03:13:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:13:57,333 INFO L225 Difference]: With dead ends: 1322 [2024-10-13 03:13:57,333 INFO L226 Difference]: Without dead ends: 1063 [2024-10-13 03:13:57,334 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-13 03:13:57,334 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:13:57,335 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.1s Time] [2024-10-13 03:13:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-13 03:13:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 933. [2024-10-13 03:13:57,412 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-13 03:13:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1291 transitions. [2024-10-13 03:13:57,416 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1291 transitions. Word has length 104 [2024-10-13 03:13:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:13:57,416 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1291 transitions. [2024-10-13 03:13:57,416 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-13 03:13:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1291 transitions. [2024-10-13 03:13:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:13:57,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:13:57,418 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-13 03:13:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:13:57,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:13:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:13:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash -831236233, now seen corresponding path program 1 times [2024-10-13 03:13:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:13:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041060072] [2024-10-13 03:13:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:13:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:13:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519210725] [2024-10-13 03:13:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:13:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:13:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:13:57,448 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-13 03:13:57,451 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-13 03:13:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:13:57,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:13:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:13:57,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:13:57,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:13:57,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:13:57,643 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-13 03:13:57,828 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-13 03:13:57,831 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:13:57,893 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:13:57,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:13:57 BoogieIcfgContainer [2024-10-13 03:13:57,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:13:57,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:13:57,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:13:57,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:13:57,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:13:49" (3/4) ... [2024-10-13 03:13:57,898 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:13:57,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:13:57,899 INFO L158 Benchmark]: Toolchain (without parser) took 9533.21ms. Allocated memory was 165.7MB in the beginning and 331.4MB in the end (delta: 165.7MB). Free memory was 95.2MB in the beginning and 126.8MB in the end (delta: -31.6MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,900 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:13:57,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.93ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 134.3MB in the end (delta: -39.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,900 INFO L158 Benchmark]: Boogie Preprocessor took 54.98ms. Allocated memory is still 165.7MB. Free memory was 130.1MB in the beginning and 124.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,900 INFO L158 Benchmark]: RCFGBuilder took 439.75ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 99.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,901 INFO L158 Benchmark]: TraceAbstraction took 8687.33ms. Allocated memory was 165.7MB in the beginning and 331.4MB in the end (delta: 165.7MB). Free memory was 99.2MB in the beginning and 127.8MB in the end (delta: -28.6MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2024-10-13 03:13:57,901 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 331.4MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:13:57,902 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.14ms. Allocated memory is still 165.7MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.93ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 134.3MB in the end (delta: -39.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.98ms. Allocated memory is still 165.7MB. Free memory was 130.1MB in the beginning and 124.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 439.75ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 99.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8687.33ms. Allocated memory was 165.7MB in the beginning and 331.4MB in the end (delta: 165.7MB). Free memory was 99.2MB in the beginning and 127.8MB in the end (delta: -28.6MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 331.4MB. Free memory is still 126.8MB. There was no memory consumed. 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: 8.6s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1989 mSDsluCounter, 2803 SdHoareTripleChecker+Invalid, 1.2s 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, 524 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.7s 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: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1072 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 5081 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-13 03:13:57,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:13:59,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:13:59,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:13:59,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:13:59,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:13:59,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:13:59,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:13:59,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:13:59,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:13:59,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:13:59,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:13:59,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:13:59,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:13:59,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:13:59,884 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:13:59,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:13:59,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:13:59,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:13:59,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:13:59,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:13:59,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:13:59,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:13:59,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:13:59,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:13:59,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:13:59,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:13:59,891 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:13:59,891 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:13:59,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:13:59,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:13:59,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:13:59,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:13:59,893 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:13:59,893 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-13 03:14:00,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:14:00,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:14:00,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:14:00,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:14:00,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:14:00,161 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-13 03:14:01,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:14:01,560 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:14:01,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-13 03:14:01,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f8ea7fe/5bb5c8e86a38470ca1d7c243785c3ee0/FLAGd48b3799b [2024-10-13 03:14:01,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f8ea7fe/5bb5c8e86a38470ca1d7c243785c3ee0 [2024-10-13 03:14:01,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:14:01,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:14:01,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:14:01,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:14:01,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:14:01,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:14:01" (1/1) ... [2024-10-13 03:14:01,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b940e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:01, skipping insertion in model container [2024-10-13 03:14:01,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:14:01" (1/1) ... [2024-10-13 03:14:01,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:14:02,145 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-13 03:14:02,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:14:02,204 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:14:02,217 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-13 03:14:02,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:14:02,271 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:14:02,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02 WrapperNode [2024-10-13 03:14:02,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:14:02,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:14:02,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:14:02,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:14:02,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,322 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-13 03:14:02,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:14:02,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:14:02,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:14:02,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:14:02,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,352 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-13 03:14:02,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:14:02,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:14:02,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:14:02,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:14:02,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (1/1) ... [2024-10-13 03:14:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:14:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:14:02,419 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-13 03:14:02,422 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-13 03:14:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:14:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:14:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:14:02,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:14:02,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:14:02,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:14:02,548 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:14:02,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:14:17,944 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:14:17,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:14:17,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:14:17,987 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:14:17,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:14:17 BoogieIcfgContainer [2024-10-13 03:14:17,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:14:17,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:14:17,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:14:17,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:14:17,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:14:01" (1/3) ... [2024-10-13 03:14:17,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b312a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:14:17, skipping insertion in model container [2024-10-13 03:14:17,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:14:02" (2/3) ... [2024-10-13 03:14:17,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b312a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:14:17, skipping insertion in model container [2024-10-13 03:14:17,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:14:17" (3/3) ... [2024-10-13 03:14:17,996 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-10-13 03:14:18,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:14:18,023 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:14:18,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:14:18,092 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;@10f87267, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:14:18,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:14:18,096 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-13 03:14:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:14:18,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:14:18,106 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-13 03:14:18,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:14:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:14:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 879549835, now seen corresponding path program 1 times [2024-10-13 03:14:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:14:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103476403] [2024-10-13 03:14:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:14:18,125 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-13 03:14:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:14:18,128 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-13 03:14:18,129 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-13 03:14:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:14:18,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:14:18,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:14:19,018 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-13 03:14:19,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:14:19,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:14:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103476403] [2024-10-13 03:14:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103476403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:14:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:14:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:14:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281595756] [2024-10-13 03:14:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:14:19,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:14:19,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:14:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:14:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:14:19,052 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-13 03:14:23,406 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-13 03:14:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:14:23,407 INFO L93 Difference]: Finished difference Result 105 states and 185 transitions. [2024-10-13 03:14:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:14:23,518 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-13 03:14:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:14:23,525 INFO L225 Difference]: With dead ends: 105 [2024-10-13 03:14:23,525 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 03:14:23,527 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-13 03:14:23,530 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-13 03:14:23,531 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-13 03:14:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 03:14:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 03:14:23,569 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-13 03:14:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-13 03:14:23,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 98 [2024-10-13 03:14:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:14:23,572 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-13 03:14:23,572 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-13 03:14:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-13 03:14:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:14:23,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:14:23,576 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-13 03:14:23,605 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-13 03:14:23,776 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-13 03:14:23,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:14:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:14:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1867586227, now seen corresponding path program 1 times [2024-10-13 03:14:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:14:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094917400] [2024-10-13 03:14:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:14:23,778 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-13 03:14:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:14:23,782 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-13 03:14:23,783 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-13 03:14:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:14:24,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:14:24,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:14:27,113 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-13 03:14:27,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:14:27,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:14:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094917400] [2024-10-13 03:14:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094917400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:14:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:14:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:14:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396545411] [2024-10-13 03:14:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:14:27,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:14:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:14:27,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:14:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:14:27,116 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-13 03:14:31,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:34,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:38,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:42,594 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-13 03:14:46,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:49,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:53,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:14:58,512 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-13 03:15:02,515 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-13 03:15:06,518 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-13 03:15:10,530 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-13 03:15:14,540 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-13 03:15:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:15:14,668 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2024-10-13 03:15:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:15:14,670 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-13 03:15:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:15:14,671 INFO L225 Difference]: With dead ends: 154 [2024-10-13 03:15:14,671 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 03:15:14,672 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-13 03:15:14,673 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:15:14,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 229 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 47.4s Time] [2024-10-13 03:15:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 03:15:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-13 03:15:14,686 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-13 03:15:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-10-13 03:15:14,687 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 98 [2024-10-13 03:15:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:15:14,688 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-10-13 03:15:14,688 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-13 03:15:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-10-13 03:15:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:15:14,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:15:14,689 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-13 03:15:14,716 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-13 03:15:14,890 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-13 03:15:14,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:15:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:15:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1794343179, now seen corresponding path program 1 times [2024-10-13 03:15:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:15:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494637024] [2024-10-13 03:15:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:15:14,892 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-13 03:15:14,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:15:14,894 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-13 03:15:14,899 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-13 03:15:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:15:15,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:15:15,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:15:15,877 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-13 03:15:15,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:15:15,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:15:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494637024] [2024-10-13 03:15:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494637024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:15:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:15:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:15:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661881233] [2024-10-13 03:15:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:15:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:15:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:15:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:15:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:15:15,880 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) [2024-10-13 03:15:20,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:15:24,361 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-13 03:15:28,365 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-13 03:15:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:15:28,537 INFO L93 Difference]: Finished difference Result 239 states and 366 transitions. [2024-10-13 03:15:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:15:28,538 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 99 [2024-10-13 03:15:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:15:28,541 INFO L225 Difference]: With dead ends: 239 [2024-10-13 03:15:28,541 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 03:15:28,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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-13 03:15:28,543 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:15:28,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 135 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-10-13 03:15:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 03:15:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2024-10-13 03:15:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-13 03:15:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2024-10-13 03:15:28,559 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 99 [2024-10-13 03:15:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:15:28,560 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2024-10-13 03:15:28,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-13 03:15:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2024-10-13 03:15:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 03:15:28,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:15:28,564 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] [2024-10-13 03:15:28,594 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 (4)] Ended with exit code 0