./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.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 d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:39:30,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:39:30,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:39:30,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:39:30,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:39:30,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:39:30,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:39:30,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:39:30,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:39:30,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:39:30,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:39:30,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:39:30,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:39:30,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:39:30,191 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:39:30,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:39:30,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:39:30,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:39:30,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:39:30,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:39:30,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:39:30,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:39:30,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:39:30,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:39:30,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:39:30,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:39:30,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:39:30,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:39:30,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:39:30,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:39:30,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:39:30,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:39:30,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:39:30,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:39:30,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:39:30,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:39:30,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:39:30,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:39:30,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:39:30,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:39:30,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:39:30,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:39:30,202 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-10-24 08:39:30,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:39:30,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:39:30,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:39:30,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:39:30,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:39:30,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:39:31,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:39:32,111 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:39:32,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:39:32,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f59cd25/6364e933180c457daaba42b65e562a56/FLAG5f1862791 [2024-10-24 08:39:32,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f59cd25/6364e933180c457daaba42b65e562a56 [2024-10-24 08:39:32,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:39:32,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:39:32,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:39:32,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:39:32,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:39:32,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff16359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32, skipping insertion in model container [2024-10-24 08:39:32,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:39:32,331 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-10-24 08:39:32,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:39:32,385 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:39:32,394 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-10-24 08:39:32,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:39:32,440 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:39:32,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32 WrapperNode [2024-10-24 08:39:32,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:39:32,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:39:32,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:39:32,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:39:32,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,488 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-24 08:39:32,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:39:32,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:39:32,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:39:32,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:39:32,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,534 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:39:32,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:39:32,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:39:32,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:39:32,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:39:32,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (1/1) ... [2024-10-24 08:39:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:39:32,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:32,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:39:32,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:39:32,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:39:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:39:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:39:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:39:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:39:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:39:32,739 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:39:32,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:39:33,067 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 08:39:33,067 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:39:33,115 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:39:33,115 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:39:33,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:33 BoogieIcfgContainer [2024-10-24 08:39:33,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:39:33,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:39:33,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:39:33,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:39:33,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:39:32" (1/3) ... [2024-10-24 08:39:33,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfd0b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:33, skipping insertion in model container [2024-10-24 08:39:33,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:32" (2/3) ... [2024-10-24 08:39:33,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfd0b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:33, skipping insertion in model container [2024-10-24 08:39:33,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:33" (3/3) ... [2024-10-24 08:39:33,125 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:39:33,137 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:39:33,137 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:39:33,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:39:33,197 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;@17e1216a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:39:33,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:39:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 08:39:33,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:33,210 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:33,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1795745291, now seen corresponding path program 1 times [2024-10-24 08:39:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233726657] [2024-10-24 08:39:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:33,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233726657] [2024-10-24 08:39:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233726657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:33,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:33,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:39:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769944405] [2024-10-24 08:39:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:39:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:39:33,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:33,664 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 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.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:33,704 INFO L93 Difference]: Finished difference Result 133 states and 219 transitions. [2024-10-24 08:39:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:39:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 104 [2024-10-24 08:39:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:33,714 INFO L225 Difference]: With dead ends: 133 [2024-10-24 08:39:33,714 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 08:39:33,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:33,721 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:33,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:39:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 08:39:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 08:39:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-24 08:39:33,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 104 [2024-10-24 08:39:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:33,764 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-24 08:39:33,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-24 08:39:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 08:39:33,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:33,772 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:33,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:39:33,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 373695249, now seen corresponding path program 1 times [2024-10-24 08:39:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587631531] [2024-10-24 08:39:33,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587631531] [2024-10-24 08:39:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587631531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919097068] [2024-10-24 08:39:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:34,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:34,129 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) 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-10-24 08:39:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:34,167 INFO L93 Difference]: Finished difference Result 132 states and 197 transitions. [2024-10-24 08:39:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) 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) Word has length 104 [2024-10-24 08:39:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:34,171 INFO L225 Difference]: With dead ends: 132 [2024-10-24 08:39:34,172 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 08:39:34,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:34,175 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:34,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:39:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 08:39:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 08:39:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-10-24 08:39:34,186 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 104 [2024-10-24 08:39:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:34,189 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-10-24 08:39:34,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) 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-10-24 08:39:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-10-24 08:39:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:39:34,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:34,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:39:34,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:34,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -191790430, now seen corresponding path program 1 times [2024-10-24 08:39:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707955772] [2024-10-24 08:39:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:37,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707955772] [2024-10-24 08:39:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707955772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:39:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884884994] [2024-10-24 08:39:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:39:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:39:37,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:39:37,664 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:40,158 INFO L93 Difference]: Finished difference Result 244 states and 354 transitions. [2024-10-24 08:39:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:39:40,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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 105 [2024-10-24 08:39:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:40,162 INFO L225 Difference]: With dead ends: 244 [2024-10-24 08:39:40,162 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 08:39:40,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-10-24 08:39:40,166 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 617 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:40,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 278 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 08:39:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 08:39:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 97. [2024-10-24 08:39:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-24 08:39:40,188 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 105 [2024-10-24 08:39:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:40,190 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-24 08:39:40,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-24 08:39:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:39:40,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:40,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:39:40,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:40,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1471654108, now seen corresponding path program 1 times [2024-10-24 08:39:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:40,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229623197] [2024-10-24 08:39:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:41,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229623197] [2024-10-24 08:39:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229623197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:39:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228214259] [2024-10-24 08:39:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:39:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:39:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:42,004 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:42,573 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2024-10-24 08:39:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:39:42,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:42,576 INFO L225 Difference]: With dead ends: 232 [2024-10-24 08:39:42,578 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 08:39:42,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:39:42,581 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 91 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:42,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 393 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:39:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 08:39:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2024-10-24 08:39:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-10-24 08:39:42,598 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 105 [2024-10-24 08:39:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:42,599 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-10-24 08:39:42,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-10-24 08:39:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:39:42,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:42,601 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:42,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:39:42,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2109032160, now seen corresponding path program 1 times [2024-10-24 08:39:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080208129] [2024-10-24 08:39:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:45,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080208129] [2024-10-24 08:39:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080208129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:45,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 08:39:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337713718] [2024-10-24 08:39:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 08:39:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 08:39:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 08:39:45,790 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:49,441 INFO L93 Difference]: Finished difference Result 486 states and 709 transitions. [2024-10-24 08:39:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:39:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 105 [2024-10-24 08:39:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:49,446 INFO L225 Difference]: With dead ends: 486 [2024-10-24 08:39:49,448 INFO L226 Difference]: Without dead ends: 392 [2024-10-24 08:39:49,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-24 08:39:49,449 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 444 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:49,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 783 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 08:39:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-24 08:39:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 257. [2024-10-24 08:39:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 205 states have internal predecessors, (288), 45 states have call successors, (45), 6 states have call predecessors, (45), 6 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 08:39:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2024-10-24 08:39:49,507 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 105 [2024-10-24 08:39:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:49,510 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2024-10-24 08:39:49,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:39:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2024-10-24 08:39:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:39:49,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:49,512 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:49,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:39:49,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:49,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 829168482, now seen corresponding path program 1 times [2024-10-24 08:39:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423163366] [2024-10-24 08:39:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423163366] [2024-10-24 08:39:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423163366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:39:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6394822] [2024-10-24 08:39:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:51,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:39:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:39:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:51,506 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:52,551 INFO L93 Difference]: Finished difference Result 429 states and 628 transitions. [2024-10-24 08:39:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:39:52,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:52,555 INFO L225 Difference]: With dead ends: 429 [2024-10-24 08:39:52,555 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 08:39:52,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:39:52,560 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:52,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 502 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 08:39:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 08:39:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 97. [2024-10-24 08:39:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-24 08:39:52,585 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 105 [2024-10-24 08:39:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:52,586 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-24 08:39:52,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-24 08:39:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:39:52,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:52,589 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:39:52,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1291383710, now seen corresponding path program 1 times [2024-10-24 08:39:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:52,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871232468] [2024-10-24 08:39:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871232468] [2024-10-24 08:39:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871232468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:39:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729463298] [2024-10-24 08:39:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:53,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:39:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:39:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:53,365 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:53,850 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-10-24 08:39:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:39:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:53,853 INFO L225 Difference]: With dead ends: 234 [2024-10-24 08:39:53,853 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 08:39:53,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:39:53,854 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 91 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:53,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 450 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:39:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 08:39:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 73. [2024-10-24 08:39:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-10-24 08:39:53,865 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 105 [2024-10-24 08:39:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-10-24 08:39:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-10-24 08:39:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-10-24 08:39:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:39:53,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:53,868 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:39:53,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 19073959, now seen corresponding path program 1 times [2024-10-24 08:39:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309559888] [2024-10-24 08:39:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 08:39:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309559888] [2024-10-24 08:39:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309559888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:39:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590275764] [2024-10-24 08:39:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:39:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:54,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:39:54,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:39:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:54,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 08:39:54,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:39:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 08:39:54,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:39:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 08:39:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590275764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:39:54,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:39:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 08:39:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971258808] [2024-10-24 08:39:54,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:39:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:39:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:39:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:39:54,574 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 08:39:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:54,785 INFO L93 Difference]: Finished difference Result 151 states and 212 transitions. [2024-10-24 08:39:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:39:54,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 107 [2024-10-24 08:39:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:54,787 INFO L225 Difference]: With dead ends: 151 [2024-10-24 08:39:54,788 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 08:39:54,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:39:54,789 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 197 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:54,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 156 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:39:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 08:39:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-24 08:39:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-10-24 08:39:54,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 107 [2024-10-24 08:39:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-10-24 08:39:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 08:39:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-10-24 08:39:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:39:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:54,800 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:54,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:39:55,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:39:55,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:55,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1569273943, now seen corresponding path program 1 times [2024-10-24 08:39:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781304263] [2024-10-24 08:39:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:39:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364157160] [2024-10-24 08:39:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:55,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:39:55,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:55,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:39:55,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 08:39:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:55,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 08:39:55,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:39:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 08:39:55,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:39:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 08:39:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781304263] [2024-10-24 08:39:56,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 08:39:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364157160] [2024-10-24 08:39:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364157160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:39:56,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:39:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-24 08:39:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873256336] [2024-10-24 08:39:56,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:39:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 08:39:56,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 08:39:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:39:56,006 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 08:39:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:56,696 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2024-10-24 08:39:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 08:39:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 107 [2024-10-24 08:39:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:56,698 INFO L225 Difference]: With dead ends: 241 [2024-10-24 08:39:56,698 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 08:39:56,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-24 08:39:56,699 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 286 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:56,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 645 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:39:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 08:39:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-24 08:39:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-10-24 08:39:56,710 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 107 [2024-10-24 08:39:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:56,710 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-10-24 08:39:56,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 08:39:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-10-24 08:39:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:39:56,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:56,712 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:56,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:39:56,912 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-10-24 08:39:56,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 495033522, now seen corresponding path program 1 times [2024-10-24 08:39:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177286773] [2024-10-24 08:39:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177286773] [2024-10-24 08:39:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177286773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904280507] [2024-10-24 08:39:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:56,983 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:57,113 INFO L93 Difference]: Finished difference Result 280 states and 377 transitions. [2024-10-24 08:39:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 107 [2024-10-24 08:39:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:57,116 INFO L225 Difference]: With dead ends: 280 [2024-10-24 08:39:57,116 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 08:39:57,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:57,117 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:57,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 185 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:39:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 08:39:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-24 08:39:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:39:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-10-24 08:39:57,130 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 107 [2024-10-24 08:39:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:57,130 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-10-24 08:39:57,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-10-24 08:39:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:39:57,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:57,132 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:57,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:39:57,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:57,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash 643315218, now seen corresponding path program 1 times [2024-10-24 08:39:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095750218] [2024-10-24 08:39:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095750218] [2024-10-24 08:39:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095750218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:58,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:39:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996609238] [2024-10-24 08:39:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:58,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:39:58,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:58,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:39:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:58,070 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:58,630 INFO L93 Difference]: Finished difference Result 467 states and 619 transitions. [2024-10-24 08:39:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:39:58,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 107 [2024-10-24 08:39:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:58,633 INFO L225 Difference]: With dead ends: 467 [2024-10-24 08:39:58,633 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 08:39:58,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:58,634 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 177 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:58,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 583 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:39:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 08:39:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 233. [2024-10-24 08:39:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 199 states have internal predecessors, (264), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:39:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2024-10-24 08:39:58,656 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 107 [2024-10-24 08:39:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2024-10-24 08:39:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2024-10-24 08:39:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:39:58,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:58,657 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:39:58,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:58,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -174333232, now seen corresponding path program 1 times [2024-10-24 08:39:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453971957] [2024-10-24 08:39:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:39:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:39:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:39:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:39:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:39:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:39:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:39:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:39:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453971957] [2024-10-24 08:39:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453971957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:39:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871142038] [2024-10-24 08:39:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:58,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:39:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:58,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:39:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:39:58,952 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:59,328 INFO L93 Difference]: Finished difference Result 677 states and 898 transitions. [2024-10-24 08:39:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:39:59,329 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), 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 107 [2024-10-24 08:39:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:59,332 INFO L225 Difference]: With dead ends: 677 [2024-10-24 08:39:59,333 INFO L226 Difference]: Without dead ends: 445 [2024-10-24 08:39:59,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:59,334 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 133 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:59,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 393 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:39:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-24 08:39:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 240. [2024-10-24 08:39:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 205 states have (on average 1.3365853658536586) internal successors, (274), 206 states have internal predecessors, (274), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:39:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-10-24 08:39:59,360 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 107 [2024-10-24 08:39:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:59,361 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-10-24 08:39:59,361 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:39:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-10-24 08:39:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:39:59,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:59,362 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:59,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 08:39:59,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:59,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash 535066765, now seen corresponding path program 1 times [2024-10-24 08:39:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799078275] [2024-10-24 08:39:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:40:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:40:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:40:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:40:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:40:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:40:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:40:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:40:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:40:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:40:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:40:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:40:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:40:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:40:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:40:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:40:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:40:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799078275] [2024-10-24 08:40:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799078275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:40:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:40:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 08:40:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255411906] [2024-10-24 08:40:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:40:00,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 08:40:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:40:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 08:40:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 08:40:00,891 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-10-24 08:40:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:40:02,223 INFO L93 Difference]: Finished difference Result 663 states and 891 transitions. [2024-10-24 08:40:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 08:40:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-10-24 08:40:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:40:02,225 INFO L225 Difference]: With dead ends: 663 [2024-10-24 08:40:02,226 INFO L226 Difference]: Without dead ends: 424 [2024-10-24 08:40:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-24 08:40:02,227 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 313 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:40:02,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 516 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 08:40:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-24 08:40:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 294. [2024-10-24 08:40:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 259 states have (on average 1.335907335907336) internal successors, (346), 260 states have internal predecessors, (346), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:40:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2024-10-24 08:40:02,255 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 108 [2024-10-24 08:40:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:40:02,256 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2024-10-24 08:40:02,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-10-24 08:40:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2024-10-24 08:40:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:40:02,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:40:02,257 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:40:02,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 08:40:02,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:40:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:40:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 683348461, now seen corresponding path program 1 times [2024-10-24 08:40:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:40:02,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141438152] [2024-10-24 08:40:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:40:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:40:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:40:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:40:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:40:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:40:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:40:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:40:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:40:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:40:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:40:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:40:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:40:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:40:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:40:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:40:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:40:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:40:02,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:40:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141438152] [2024-10-24 08:40:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141438152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:40:02,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:40:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:40:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048713786] [2024-10-24 08:40:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:40:02,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:40:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:40:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:40:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:40:02,615 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-24 08:40:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:40:03,253 INFO L93 Difference]: Finished difference Result 851 states and 1147 transitions. [2024-10-24 08:40:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:40:03,254 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), 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-10-24 08:40:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:40:03,259 INFO L225 Difference]: With dead ends: 851 [2024-10-24 08:40:03,259 INFO L226 Difference]: Without dead ends: 558 [2024-10-24 08:40:03,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:40:03,261 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 165 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:40:03,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 586 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:40:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-24 08:40:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 470. [2024-10-24 08:40:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 401 states have (on average 1.2967581047381547) internal successors, (520), 403 states have internal predecessors, (520), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 08:40:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 624 transitions. [2024-10-24 08:40:03,324 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 624 transitions. Word has length 108 [2024-10-24 08:40:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:40:03,325 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 624 transitions. [2024-10-24 08:40:03,325 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:40:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 624 transitions. [2024-10-24 08:40:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:40:03,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:40:03,327 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:40:03,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 08:40:03,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:40:03,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:40:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387724, now seen corresponding path program 1 times [2024-10-24 08:40:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:40:03,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487026161] [2024-10-24 08:40:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:40:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:40:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:40:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568519657] [2024-10-24 08:40:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:40:03,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:40:03,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:40:03,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:40:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 08:40:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:40:03,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:40:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:40:03,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:40:03,870 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:40:03,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:40:03,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 08:40:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:40:04,078 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:40:04,158 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:40:04,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:40:04 BoogieIcfgContainer [2024-10-24 08:40:04,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:40:04,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:40:04,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:40:04,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:40:04,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:33" (3/4) ... [2024-10-24 08:40:04,164 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:40:04,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:40:04,166 INFO L158 Benchmark]: Toolchain (without parser) took 32026.45ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 110.5MB in the beginning and 114.5MB in the end (delta: -4.0MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,166 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:40:04,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.95ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 95.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.09ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 92.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,167 INFO L158 Benchmark]: Boogie Preprocessor took 62.90ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 88.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,167 INFO L158 Benchmark]: RCFGBuilder took 562.78ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 64.7MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,168 INFO L158 Benchmark]: TraceAbstraction took 31043.20ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 63.9MB in the beginning and 115.5MB in the end (delta: -51.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,168 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 314.6MB. Free memory was 115.5MB in the beginning and 114.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:40:04,170 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.17ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.95ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 95.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.09ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 92.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.90ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 88.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 562.78ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 64.7MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31043.20ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 63.9MB in the beginning and 115.5MB in the end (delta: -51.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 314.6MB. Free memory was 115.5MB in the beginning and 114.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 15, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2689 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2683 mSDsluCounter, 5748 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4276 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4936 IncrementalHoareTripleChecker+Invalid, 5109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 1472 mSDtfsCounter, 4936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 987 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=14, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1202 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1914 NumberOfCodeBlocks, 1914 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1788 ConstructedInterpolants, 0 QuantifiedInterpolants, 9011 SizeOfPredicates, 9 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 6954/7140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:40:04,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.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 d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:40:06,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:40:06,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:40:06,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:40:06,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:40:06,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:40:06,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:40:06,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:40:06,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:40:06,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:40:06,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:40:06,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:40:06,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:40:06,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:40:06,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:40:06,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:40:06,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:40:06,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:40:06,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:40:06,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:40:06,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:40:06,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:40:06,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:40:06,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:40:06,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:40:06,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:40:06,478 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:40:06,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:40:06,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:40:06,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:40:06,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:40:06,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:40:06,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:40:06,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:40:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:40:06,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:40:06,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:40:06,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:40:06,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:40:06,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:40:06,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:40:06,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:40:06,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:40:06,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:40:06,491 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:40:06,491 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-10-24 08:40:06,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:40:06,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:40:06,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:40:06,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:40:06,804 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:40:06,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:40:08,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:40:08,630 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:40:08,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:40:08,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c405f0d/9399a509b29b44e6951ede4cc189e355/FLAG0e13ca1ac [2024-10-24 08:40:08,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c405f0d/9399a509b29b44e6951ede4cc189e355 [2024-10-24 08:40:08,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:40:08,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:40:08,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:40:08,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:40:08,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:40:08,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:40:08" (1/1) ... [2024-10-24 08:40:08,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b8c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:08, skipping insertion in model container [2024-10-24 08:40:08,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:40:08" (1/1) ... [2024-10-24 08:40:09,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:40:09,179 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-10-24 08:40:09,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:40:09,281 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:40:09,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-10-24 08:40:09,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:40:09,363 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:40:09,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09 WrapperNode [2024-10-24 08:40:09,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:40:09,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:40:09,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:40:09,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:40:09,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,425 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-24 08:40:09,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:40:09,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:40:09,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:40:09,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:40:09,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,462 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:40:09,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:40:09,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:40:09,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:40:09,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:40:09,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (1/1) ... [2024-10-24 08:40:09,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:40:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:40:09,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:40:09,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:40:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:40:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:40:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:40:09,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:40:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:40:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:40:09,656 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:40:09,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:40:10,041 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 08:40:10,041 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:40:10,100 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:40:10,103 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:40:10,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:40:10 BoogieIcfgContainer [2024-10-24 08:40:10,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:40:10,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:40:10,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:40:10,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:40:10,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:40:08" (1/3) ... [2024-10-24 08:40:10,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:40:10, skipping insertion in model container [2024-10-24 08:40:10,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:09" (2/3) ... [2024-10-24 08:40:10,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:40:10, skipping insertion in model container [2024-10-24 08:40:10,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:40:10" (3/3) ... [2024-10-24 08:40:10,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-10-24 08:40:10,131 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:40:10,131 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:40:10,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:40:10,201 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;@541307d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:40:10,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:40:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:40:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 08:40:10,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:40:10,220 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:40:10,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:40:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:40:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2001609788, now seen corresponding path program 1 times [2024-10-24 08:40:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:40:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045811300] [2024-10-24 08:40:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:40:10,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:40:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:40:10,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:40:10,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:40:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:10,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:40:10,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:40:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:40:10,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:40:10,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:40:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045811300] [2024-10-24 08:40:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045811300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:40:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:40:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:40:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974389492] [2024-10-24 08:40:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:40:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:40:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:40:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:40:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:40:10,549 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:40:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:40:10,679 INFO L93 Difference]: Finished difference Result 95 states and 165 transitions. [2024-10-24 08:40:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:40:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 96 [2024-10-24 08:40:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:40:10,699 INFO L225 Difference]: With dead ends: 95 [2024-10-24 08:40:10,699 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 08:40:10,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:40:10,709 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:40:10,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:40:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 08:40:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 08:40:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:40:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-24 08:40:10,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 96 [2024-10-24 08:40:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:40:10,753 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-24 08:40:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:40:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-24 08:40:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 08:40:10,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:40:10,759 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:40:10,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:40:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:40:10,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:40:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:40:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1332527400, now seen corresponding path program 1 times [2024-10-24 08:40:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:40:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368814971] [2024-10-24 08:40:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:40:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:40:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:40:10,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:40:10,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:40:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:40:11,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 08:40:11,180 INFO L278 TraceCheckSpWp]: Computing forward predicates...