./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:46:04,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:46:04,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:46:04,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:46:04,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:46:04,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:46:04,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:46:04,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:46:04,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:46:04,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:46:04,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:46:04,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:46:04,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:46:04,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:46:04,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:46:04,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:46:04,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:46:04,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:46:04,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:46:04,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:46:04,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:46:04,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:46:04,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:46:04,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:46:04,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:46:04,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:46:04,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:46:04,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:46:04,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:46:04,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:46:04,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:46:04,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:46:04,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:46:04,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:46:04,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:46:04,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:46:04,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:46:04,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:46:04,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:46:04,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:46:04,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:46:04,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:46:04,473 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 -> eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 [2024-11-12 06:46:04,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:46:04,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:46:04,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:46:04,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:46:04,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:46:04,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:06,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:46:06,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:46:06,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:06,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894aa600b/07d274a7ddad4779a8bb64fba490aaff/FLAG6833fd108 [2024-11-12 06:46:06,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894aa600b/07d274a7ddad4779a8bb64fba490aaff [2024-11-12 06:46:06,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:46:06,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:46:06,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:46:06,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:46:06,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:46:06,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:46:06" (1/1) ... [2024-11-12 06:46:06,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d766337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:06, skipping insertion in model container [2024-11-12 06:46:06,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:46:06" (1/1) ... [2024-11-12 06:46:06,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:46:07,044 WARN L250 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_operatoramount_amount50_file-3.i[914,927] [2024-11-12 06:46:07,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:46:07,127 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:46:07,136 WARN L250 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_operatoramount_amount50_file-3.i[914,927] [2024-11-12 06:46:07,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:46:07,183 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:46:07,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07 WrapperNode [2024-11-12 06:46:07,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:46:07,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:46:07,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:46:07,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:46:07,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,265 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-12 06:46:07,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:46:07,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:46:07,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:46:07,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:46:07,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,327 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-11-12 06:46:07,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:46:07,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:46:07,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:46:07,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:46:07,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (1/1) ... [2024-11-12 06:46:07,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:46:07,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:46:07,406 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-11-12 06:46:07,409 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-11-12 06:46:07,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:46:07,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:46:07,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:46:07,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:46:07,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:46:07,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:46:07,515 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:46:07,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:46:07,881 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 06:46:07,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:46:07,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:46:07,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:46:07,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:46:07 BoogieIcfgContainer [2024-11-12 06:46:07,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:46:07,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:46:07,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:46:07,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:46:07,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:46:06" (1/3) ... [2024-11-12 06:46:07,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd10df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:46:07, skipping insertion in model container [2024-11-12 06:46:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:07" (2/3) ... [2024-11-12 06:46:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd10df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:46:07, skipping insertion in model container [2024-11-12 06:46:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:46:07" (3/3) ... [2024-11-12 06:46:07,906 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:07,923 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:46:07,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:46:07,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:46:07,994 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;@410a92d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:46:07,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:46:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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-11-12 06:46:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 06:46:08,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:08,013 INFO L218 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-11-12 06:46:08,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:08,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -483447450, now seen corresponding path program 1 times [2024-11-12 06:46:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246237030] [2024-11-12 06:46:08,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246237030] [2024-11-12 06:46:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246237030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:08,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:46:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002978258] [2024-11-12 06:46:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:46:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:46:08,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:46:08,465 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-11-12 06:46:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:08,502 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions. [2024-11-12 06:46:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:46:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 105 [2024-11-12 06:46:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:08,513 INFO L225 Difference]: With dead ends: 135 [2024-11-12 06:46:08,514 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 06:46:08,518 INFO L434 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-11-12 06:46:08,524 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:08,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:46:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 06:46:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 06:46:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 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-11-12 06:46:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions. [2024-11-12 06:46:08,578 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 105 [2024-11-12 06:46:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:08,579 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 102 transitions. [2024-11-12 06:46:08,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-11-12 06:46:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 102 transitions. [2024-11-12 06:46:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 06:46:08,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:08,587 INFO L218 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-11-12 06:46:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:46:08,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:08,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1144814552, now seen corresponding path program 1 times [2024-11-12 06:46:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251868657] [2024-11-12 06:46:08,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251868657] [2024-11-12 06:46:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251868657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:46:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004957878] [2024-11-12 06:46:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:46:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:46:09,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:46:09,161 INFO L87 Difference]: Start difference. First operand 67 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-12 06:46:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:09,244 INFO L93 Difference]: Finished difference Result 195 states and 300 transitions. [2024-11-12 06:46:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:46:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 105 [2024-11-12 06:46:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:09,247 INFO L225 Difference]: With dead ends: 195 [2024-11-12 06:46:09,247 INFO L226 Difference]: Without dead ends: 131 [2024-11-12 06:46:09,248 INFO L434 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-11-12 06:46:09,251 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:09,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:46:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-12 06:46:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-12 06:46:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 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-11-12 06:46:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2024-11-12 06:46:09,285 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 105 [2024-11-12 06:46:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:09,287 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2024-11-12 06:46:09,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-12 06:46:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2024-11-12 06:46:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 06:46:09,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:09,292 INFO L218 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, 1] [2024-11-12 06:46:09,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:46:09,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:09,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash -759328735, now seen corresponding path program 1 times [2024-11-12 06:46:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:09,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844207731] [2024-11-12 06:46:09,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:09,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844207731] [2024-11-12 06:46:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844207731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:46:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752048661] [2024-11-12 06:46:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:46:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:09,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:46:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:46:09,503 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 06:46:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:09,606 INFO L93 Difference]: Finished difference Result 373 states and 572 transitions. [2024-11-12 06:46:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:46:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 106 [2024-11-12 06:46:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:09,609 INFO L225 Difference]: With dead ends: 373 [2024-11-12 06:46:09,611 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 06:46:09,612 INFO L434 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-11-12 06:46:09,613 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:09,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 257 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:46:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 06:46:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-11-12 06:46:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 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-11-12 06:46:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2024-11-12 06:46:09,660 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 106 [2024-11-12 06:46:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:09,663 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2024-11-12 06:46:09,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 06:46:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2024-11-12 06:46:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 06:46:09,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:09,668 INFO L218 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, 1] [2024-11-12 06:46:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:46:09,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -224804307, now seen corresponding path program 1 times [2024-11-12 06:46:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172045704] [2024-11-12 06:46:09,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172045704] [2024-11-12 06:46:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172045704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:09,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:09,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:46:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538507745] [2024-11-12 06:46:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:46:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:09,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:46:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:46:09,766 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 06:46:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:09,826 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions. [2024-11-12 06:46:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:46:09,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 106 [2024-11-12 06:46:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:09,831 INFO L225 Difference]: With dead ends: 605 [2024-11-12 06:46:09,831 INFO L226 Difference]: Without dead ends: 363 [2024-11-12 06:46:09,832 INFO L434 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-11-12 06:46:09,833 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:09,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:46:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-12 06:46:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 277. [2024-11-12 06:46:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 212 states have (on average 1.3962264150943395) internal successors, (296), 212 states have internal predecessors, (296), 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-11-12 06:46:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 416 transitions. [2024-11-12 06:46:09,858 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 416 transitions. Word has length 106 [2024-11-12 06:46:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:09,858 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 416 transitions. [2024-11-12 06:46:09,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 06:46:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 416 transitions. [2024-11-12 06:46:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 06:46:09,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:09,860 INFO L218 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, 1, 1] [2024-11-12 06:46:09,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:46:09,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash 370101230, now seen corresponding path program 1 times [2024-11-12 06:46:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44426802] [2024-11-12 06:46:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-12 06:46:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44426802] [2024-11-12 06:46:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44426802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:46:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914335585] [2024-11-12 06:46:10,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:10,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:46:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:46:10,901 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-11-12 06:46:10,903 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-11-12 06:46:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:11,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 06:46:11,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:46:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 287 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 06:46:11,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:46:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 30 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-12 06:46:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914335585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:46:12,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:46:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-12 06:46:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502168196] [2024-11-12 06:46:12,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:46:12,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 06:46:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 06:46:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-11-12 06:46:12,623 INFO L87 Difference]: Start difference. First operand 277 states and 416 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) [2024-11-12 06:46:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:13,868 INFO L93 Difference]: Finished difference Result 565 states and 816 transitions. [2024-11-12 06:46:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 06:46:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) Word has length 107 [2024-11-12 06:46:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:13,872 INFO L225 Difference]: With dead ends: 565 [2024-11-12 06:46:13,872 INFO L226 Difference]: Without dead ends: 291 [2024-11-12 06:46:13,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=680, Invalid=1576, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 06:46:13,874 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 827 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:13,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 331 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:46:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-12 06:46:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2024-11-12 06:46:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 136 states have internal predecessors, (178), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:46:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 238 transitions. [2024-11-12 06:46:13,935 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 238 transitions. Word has length 107 [2024-11-12 06:46:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:13,937 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 238 transitions. [2024-11-12 06:46:13,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) [2024-11-12 06:46:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 238 transitions. [2024-11-12 06:46:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 06:46:13,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:13,940 INFO L218 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, 1, 1] [2024-11-12 06:46:13,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:46:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:46:14,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:14,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1226623180, now seen corresponding path program 1 times [2024-11-12 06:46:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:14,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429771924] [2024-11-12 06:46:14,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429771924] [2024-11-12 06:46:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429771924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:14,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:14,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:46:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578575913] [2024-11-12 06:46:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:14,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:46:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:46:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:46:14,457 INFO L87 Difference]: Start difference. First operand 177 states and 238 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-11-12 06:46:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:14,849 INFO L93 Difference]: Finished difference Result 615 states and 831 transitions. [2024-11-12 06:46:14,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:46:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 107 [2024-11-12 06:46:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:14,854 INFO L225 Difference]: With dead ends: 615 [2024-11-12 06:46:14,854 INFO L226 Difference]: Without dead ends: 527 [2024-11-12 06:46:14,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:46:14,856 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 297 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:14,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 465 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:46:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-12 06:46:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2024-11-12 06:46:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 398 states have (on average 1.3165829145728642) internal successors, (524), 398 states have internal predecessors, (524), 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-11-12 06:46:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 704 transitions. [2024-11-12 06:46:14,943 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 704 transitions. Word has length 107 [2024-11-12 06:46:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:14,944 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 704 transitions. [2024-11-12 06:46:14,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-11-12 06:46:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 704 transitions. [2024-11-12 06:46:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 06:46:14,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:14,948 INFO L218 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, 1, 1, 1] [2024-11-12 06:46:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:46:14,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:14,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1128178340, now seen corresponding path program 1 times [2024-11-12 06:46:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695344396] [2024-11-12 06:46:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695344396] [2024-11-12 06:46:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695344396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 06:46:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598740648] [2024-11-12 06:46:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 06:46:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 06:46:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:46:15,287 INFO L87 Difference]: Start difference. First operand 519 states and 704 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-11-12 06:46:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:15,800 INFO L93 Difference]: Finished difference Result 1047 states and 1417 transitions. [2024-11-12 06:46:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:46:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 108 [2024-11-12 06:46:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:15,806 INFO L225 Difference]: With dead ends: 1047 [2024-11-12 06:46:15,806 INFO L226 Difference]: Without dead ends: 531 [2024-11-12 06:46:15,808 INFO L434 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-11-12 06:46:15,809 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 298 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:15,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 566 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:46:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-12 06:46:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 521. [2024-11-12 06:46:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 400 states have (on average 1.3125) internal successors, (525), 400 states have internal predecessors, (525), 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-11-12 06:46:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 705 transitions. [2024-11-12 06:46:15,873 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 705 transitions. Word has length 108 [2024-11-12 06:46:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 705 transitions. [2024-11-12 06:46:15,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-11-12 06:46:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 705 transitions. [2024-11-12 06:46:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 06:46:15,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:15,875 INFO L218 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, 1, 1, 1] [2024-11-12 06:46:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:46:15,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1231124677, now seen corresponding path program 1 times [2024-11-12 06:46:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243201026] [2024-11-12 06:46:15,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:46:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:46:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:46:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:46:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:46:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:46:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:46:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:46:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:46:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:46:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:46:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:46:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:46:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:46:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:46:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:16,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-11-12 06:46:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:46:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243201026] [2024-11-12 06:46:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243201026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:46:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938959839] [2024-11-12 06:46:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:46:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:46:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:46:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:46:16,116 INFO L87 Difference]: Start difference. First operand 521 states and 705 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:46:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:16,395 INFO L93 Difference]: Finished difference Result 1337 states and 1835 transitions. [2024-11-12 06:46:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:46:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 108 [2024-11-12 06:46:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:16,401 INFO L225 Difference]: With dead ends: 1337 [2024-11-12 06:46:16,401 INFO L226 Difference]: Without dead ends: 1075 [2024-11-12 06:46:16,402 INFO L434 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-11-12 06:46:16,403 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:16,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 366 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:46:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-12 06:46:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 942. [2024-11-12 06:46:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 741 states have (on average 1.3319838056680162) internal successors, (987), 741 states have internal predecessors, (987), 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-11-12 06:46:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1287 transitions. [2024-11-12 06:46:16,518 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1287 transitions. Word has length 108 [2024-11-12 06:46:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:16,518 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1287 transitions. [2024-11-12 06:46:16,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:46:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1287 transitions. [2024-11-12 06:46:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 06:46:16,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:16,520 INFO L218 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, 1, 1, 1, 1] [2024-11-12 06:46:16,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:46:16,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:16,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:16,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1246721589, now seen corresponding path program 1 times [2024-11-12 06:46:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:46:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413510868] [2024-11-12 06:46:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:46:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:46:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841413503] [2024-11-12 06:46:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:46:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:46:16,585 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-11-12 06:46:16,587 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-11-12 06:46:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:46:16,729 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:46:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:46:16,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:46:16,847 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:46:16,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:46:16,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 06:46:17,049 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,SelfDestructingSolverStorable8 [2024-11-12 06:46:17,054 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:46:17,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:46:17,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:46:17 BoogieIcfgContainer [2024-11-12 06:46:17,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:46:17,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:46:17,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:46:17,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:46:17,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:46:07" (3/4) ... [2024-11-12 06:46:17,132 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:46:17,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:46:17,134 INFO L158 Benchmark]: Toolchain (without parser) took 10326.60ms. Allocated memory was 178.3MB in the beginning and 295.7MB in the end (delta: 117.4MB). Free memory was 106.8MB in the beginning and 145.4MB in the end (delta: -38.6MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,134 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:46:17,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.54ms. Allocated memory is still 178.3MB. Free memory was 106.5MB in the beginning and 91.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.65ms. Allocated memory is still 178.3MB. Free memory was 91.2MB in the beginning and 147.5MB in the end (delta: -56.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,135 INFO L158 Benchmark]: Boogie Preprocessor took 104.62ms. Allocated memory is still 178.3MB. Free memory was 147.5MB in the beginning and 142.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,135 INFO L158 Benchmark]: RCFGBuilder took 524.24ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 119.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,135 INFO L158 Benchmark]: TraceAbstraction took 9229.42ms. Allocated memory was 178.3MB in the beginning and 295.7MB in the end (delta: 117.4MB). Free memory was 118.8MB in the beginning and 145.4MB in the end (delta: -26.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-11-12 06:46:17,135 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 295.7MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:46:17,137 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.19ms. Allocated memory is still 178.3MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.54ms. Allocated memory is still 178.3MB. Free memory was 106.5MB in the beginning and 91.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.65ms. Allocated memory is still 178.3MB. Free memory was 91.2MB in the beginning and 147.5MB in the end (delta: -56.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.62ms. Allocated memory is still 178.3MB. Free memory was 147.5MB in the beginning and 142.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.24ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 119.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9229.42ms. Allocated memory was 178.3MB in the beginning and 295.7MB in the end (delta: 117.4MB). Free memory was 118.8MB in the beginning and 145.4MB in the end (delta: -26.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 295.7MB. Free memory is still 145.4MB. 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; VAL [isInitial=0, 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=1, var_1_5=-32, var_1_6=256] [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 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=1, var_1_5=-32, var_1_6=256] [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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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] 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=41/5, var_1_13=-1, var_1_14=127, 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] [L67] 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=127, 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] [L68] COND FALSE !(stepLocal_1 || var_1_3) [L73] 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1788 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1788 mSDsluCounter, 2482 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1624 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 858 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=8, InterpolantAutomatonStates: 53, 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, 8 MinimizatonAttempts, 355 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1056 ConstructedInterpolants, 0 QuantifiedInterpolants, 4052 SizeOfPredicates, 7 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 4146/4200 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-11-12 06:46:17,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:46:19,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:46:19,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:46:19,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:46:19,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:46:19,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:46:19,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:46:19,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:46:19,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:46:19,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:46:19,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:46:19,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:46:19,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:46:19,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:46:19,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:46:19,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:46:19,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:46:19,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:46:19,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:46:19,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:46:19,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:46:19,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:46:19,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:46:19,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:46:19,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:46:19,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:46:19,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:46:19,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:46:19,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:46:19,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:46:19,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:46:19,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:46:19,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:46:19,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:46:19,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:46:19,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:46:19,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:46:19,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:46:19,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:46:19,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:46:19,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:46:19,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:46:19,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:46:19,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:46:19,395 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 -> eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 [2024-11-12 06:46:19,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:46:19,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:46:19,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:46:19,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:46:19,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:46:19,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:21,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:46:21,425 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:46:21,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:21,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fd9daf5/6d265e35a39d4f80a131c6f01cbccae6/FLAG0b06a232e [2024-11-12 06:46:21,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fd9daf5/6d265e35a39d4f80a131c6f01cbccae6 [2024-11-12 06:46:21,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:46:21,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:46:21,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:46:21,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:46:21,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:46:21,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:46:21" (1/1) ... [2024-11-12 06:46:21,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eda871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:21, skipping insertion in model container [2024-11-12 06:46:21,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:46:21" (1/1) ... [2024-11-12 06:46:21,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:46:22,028 WARN L250 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_operatoramount_amount50_file-3.i[914,927] [2024-11-12 06:46:22,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:46:22,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:46:22,133 WARN L250 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_operatoramount_amount50_file-3.i[914,927] [2024-11-12 06:46:22,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:46:22,195 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:46:22,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22 WrapperNode [2024-11-12 06:46:22,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:46:22,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:46:22,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:46:22,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:46:22,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,258 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-12 06:46:22,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:46:22,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:46:22,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:46:22,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:46:22,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,297 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-11-12 06:46:22,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:46:22,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:46:22,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:46:22,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:46:22,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (1/1) ... [2024-11-12 06:46:22,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:46:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:46:22,370 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-11-12 06:46:22,376 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-11-12 06:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:46:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:46:22,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:46:22,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:46:22,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:46:38,646 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 06:46:38,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:46:38,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:46:38,663 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:46:38,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:46:38 BoogieIcfgContainer [2024-11-12 06:46:38,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:46:38,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:46:38,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:46:38,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:46:38,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:46:21" (1/3) ... [2024-11-12 06:46:38,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bcd599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:46:38, skipping insertion in model container [2024-11-12 06:46:38,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:46:22" (2/3) ... [2024-11-12 06:46:38,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bcd599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:46:38, skipping insertion in model container [2024-11-12 06:46:38,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:46:38" (3/3) ... [2024-11-12 06:46:38,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-3.i [2024-11-12 06:46:38,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:46:38,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:46:38,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:46:38,780 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;@19ba60b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:46:38,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:46:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 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-11-12 06:46:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:46:38,797 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:38,798 INFO L218 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-11-12 06:46:38,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1060225133, now seen corresponding path program 1 times [2024-11-12 06:46:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:46:38,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121591094] [2024-11-12 06:46:38,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:38,823 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-11-12 06:46:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:46:38,827 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-11-12 06:46:38,828 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-11-12 06:46:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:39,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:46:39,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:46:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-12 06:46:39,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:46:39,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:46:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121591094] [2024-11-12 06:46:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121591094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:39,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:46:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103165560] [2024-11-12 06:46:39,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:46:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:46:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:46:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:46:39,927 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-12 06:46:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:46:39,955 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2024-11-12 06:46:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:46:39,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 102 [2024-11-12 06:46:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:46:39,982 INFO L225 Difference]: With dead ends: 113 [2024-11-12 06:46:39,982 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 06:46:39,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-11-12 06:46:39,988 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:46:39,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:46:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 06:46:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 06:46:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 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-11-12 06:46:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-12 06:46:40,038 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 102 [2024-11-12 06:46:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:46:40,039 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-12 06:46:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-12 06:46:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-12 06:46:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:46:40,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:46:40,044 INFO L218 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-11-12 06:46:40,081 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 06:46:40,245 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-11-12 06:46:40,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:46:40,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:46:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -322097135, now seen corresponding path program 1 times [2024-11-12 06:46:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:46:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669292116] [2024-11-12 06:46:40,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:46:40,248 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-11-12 06:46:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:46:40,252 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-11-12 06:46:40,253 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-11-12 06:46:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:46:41,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 06:46:41,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:46:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:46:46,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:46:46,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:46:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669292116] [2024-11-12 06:46:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669292116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:46:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:46:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:46:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268001330] [2024-11-12 06:46:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:46:46,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:46:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:46:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:46:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:46:46,580 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-11-12 06:46:50,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:46:54,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:46:58,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:03,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:07,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:12,372 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-11-12 06:47:16,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:47:16,611 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2024-11-12 06:47:16,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:47:16,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-11-12 06:47:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:47:16,617 INFO L225 Difference]: With dead ends: 162 [2024-11-12 06:47:16,617 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 06:47:16,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:47:16,621 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:47:16,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 142 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 6 Unknown, 0 Unchecked, 30.0s Time] [2024-11-12 06:47:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 06:47:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-12 06:47:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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-11-12 06:47:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2024-11-12 06:47:16,663 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 102 [2024-11-12 06:47:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:47:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2024-11-12 06:47:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-11-12 06:47:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2024-11-12 06:47:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 06:47:16,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:47:16,669 INFO L218 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-11-12 06:47:16,704 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-11-12 06:47:16,870 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-11-12 06:47:16,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:47:16,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:47:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1956782635, now seen corresponding path program 1 times [2024-11-12 06:47:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:47:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981136292] [2024-11-12 06:47:16,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:47:16,872 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-11-12 06:47:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:47:16,873 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-11-12 06:47:16,874 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-11-12 06:47:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:47:17,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 06:47:17,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:47:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:47:18,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:47:18,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:47:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981136292] [2024-11-12 06:47:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981136292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:47:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:47:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:47:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683102375] [2024-11-12 06:47:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:47:18,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:47:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:47:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:47:18,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:47:18,072 INFO L87 Difference]: Start difference. First operand 107 states and 162 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-11-12 06:47:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:26,651 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-11-12 06:47:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:47:26,791 INFO L93 Difference]: Finished difference Result 253 states and 383 transitions. [2024-11-12 06:47:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:47:26,792 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-11-12 06:47:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:47:26,794 INFO L225 Difference]: With dead ends: 253 [2024-11-12 06:47:26,794 INFO L226 Difference]: Without dead ends: 149 [2024-11-12 06:47:26,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:47:26,796 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:47:26,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 153 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-12 06:47:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-12 06:47:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2024-11-12 06:47:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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-11-12 06:47:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-12 06:47:26,823 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 103 [2024-11-12 06:47:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:47:26,823 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-12 06:47:26,824 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-11-12 06:47:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2024-11-12 06:47:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 06:47:26,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:47:26,827 INFO L218 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-11-12 06:47:26,855 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 06:47:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-12 06:47:27,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:47:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:47:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 746052782, now seen corresponding path program 1 times [2024-11-12 06:47:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:47:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965911764] [2024-11-12 06:47:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:47:27,030 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-11-12 06:47:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:47:27,035 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-12 06:47:27,036 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 (5)] Waiting until timeout for monitored process [2024-11-12 06:47:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:47:27,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:47:27,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:47:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:47:31,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:47:31,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:47:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965911764] [2024-11-12 06:47:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965911764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:47:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:47:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:47:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629881062] [2024-11-12 06:47:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:47:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:47:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:47:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:47:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:47:31,121 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-11-12 06:47:34,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:47:35,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []