./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_floatingpointinfluence_no-floats_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-72.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 c59859db1de32b14e97175c7815ca7da18f68a8dcc54297861a94ac58dd03527 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:06:57,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:06:57,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:06:57,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:06:57,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:06:57,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:06:57,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:06:57,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:06:57,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:06:57,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:06:57,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:06:57,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:06:57,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:06:57,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:06:57,162 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:06:57,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:06:57,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:06:57,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:06:57,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:06:57,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:06:57,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:06:57,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:06:57,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:06:57,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:06:57,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:06:57,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:06:57,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:06:57,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:06:57,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:06:57,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:06:57,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:06:57,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:06:57,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:06:57,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:06:57,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:06:57,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:06:57,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:06:57,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:06:57,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:06:57,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:06:57,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:06:57,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:06:57,172 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 -> c59859db1de32b14e97175c7815ca7da18f68a8dcc54297861a94ac58dd03527 [2024-10-14 11:06:57,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:06:57,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:06:57,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:06:57,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:06:57,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:06:57,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:06:58,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:06:59,167 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:06:59,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:06:59,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45680f775/7892849235014e0e852a093b1f17eb05/FLAG19b757a69 [2024-10-14 11:06:59,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45680f775/7892849235014e0e852a093b1f17eb05 [2024-10-14 11:06:59,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:06:59,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:06:59,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:06:59,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:06:59,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:06:59,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d92b410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59, skipping insertion in model container [2024-10-14 11:06:59,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:06:59,725 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_floatingpointinfluence_no-floats_file-72.i[916,929] [2024-10-14 11:06:59,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:06:59,797 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:06:59,809 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_floatingpointinfluence_no-floats_file-72.i[916,929] [2024-10-14 11:06:59,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:06:59,870 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:06:59,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59 WrapperNode [2024-10-14 11:06:59,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:06:59,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:06:59,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:06:59,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:06:59,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,929 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-14 11:06:59,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:06:59,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:06:59,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:06:59,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:06:59,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:06:59,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:06:59,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:06:59,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:06:59,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:06:59,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (1/1) ... [2024-10-14 11:06:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:00,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:00,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:07:00,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:07:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:07:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:07:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:07:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:07:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:07:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:07:00,163 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:07:00,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:07:00,531 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:07:00,531 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:07:00,578 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:07:00,578 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:07:00,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:00 BoogieIcfgContainer [2024-10-14 11:07:00,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:07:00,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:07:00,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:07:00,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:07:00,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:06:59" (1/3) ... [2024-10-14 11:07:00,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd84d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:00, skipping insertion in model container [2024-10-14 11:07:00,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:59" (2/3) ... [2024-10-14 11:07:00,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd84d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:00, skipping insertion in model container [2024-10-14 11:07:00,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:00" (3/3) ... [2024-10-14 11:07:00,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:07:00,603 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:07:00,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:07:00,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:07:00,681 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;@76e8c0e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:07:00,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:07:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:07:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:00,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:00,702 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:00,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -475487498, now seen corresponding path program 1 times [2024-10-14 11:07:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708107915] [2024-10-14 11:07:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:07:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:07:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:07:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:07:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:07:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:07:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:07:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708107915] [2024-10-14 11:07:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708107915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:01,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:01,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:07:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446747296] [2024-10-14 11:07:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:07:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:07:01,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:01,075 INFO L87 Difference]: Start difference. First operand has 49 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 11:07:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:01,117 INFO L93 Difference]: Finished difference Result 95 states and 171 transitions. [2024-10-14 11:07:01,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:07:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 124 [2024-10-14 11:07:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:01,131 INFO L225 Difference]: With dead ends: 95 [2024-10-14 11:07:01,131 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 11:07:01,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:01,140 INFO L432 NwaCegarLoop]: 68 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, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:01,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:07:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 11:07:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 11:07:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:07:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-14 11:07:01,184 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 124 [2024-10-14 11:07:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-14 11:07:01,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 11:07:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-14 11:07:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:01,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:01,188 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:07:01,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:01,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1800542156, now seen corresponding path program 1 times [2024-10-14 11:07:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274735259] [2024-10-14 11:07:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:07:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:07:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:07:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:07:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:07:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:07:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:07:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274735259] [2024-10-14 11:07:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274735259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:04,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:04,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:07:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024077156] [2024-10-14 11:07:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:04,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:07:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:07:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:07:04,508 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:05,838 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2024-10-14 11:07:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:07:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 124 [2024-10-14 11:07:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:05,842 INFO L225 Difference]: With dead ends: 148 [2024-10-14 11:07:05,843 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 11:07:05,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 11:07:05,844 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 113 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:05,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 336 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:07:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 11:07:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2024-10-14 11:07:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 11:07:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2024-10-14 11:07:05,886 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 124 [2024-10-14 11:07:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:05,887 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2024-10-14 11:07:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2024-10-14 11:07:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:05,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:05,892 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:07:05,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1800482574, now seen corresponding path program 1 times [2024-10-14 11:07:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950370803] [2024-10-14 11:07:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:07:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:07:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:07:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:07:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:07:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:07:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:07:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950370803] [2024-10-14 11:07:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950370803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:08,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:07:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492473420] [2024-10-14 11:07:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:08,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:07:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:07:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:07:08,053 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:08,551 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2024-10-14 11:07:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:07:08,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 124 [2024-10-14 11:07:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:08,556 INFO L225 Difference]: With dead ends: 148 [2024-10-14 11:07:08,557 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 11:07:08,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:07:08,558 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:08,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:07:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 11:07:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-10-14 11:07:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 88 states have internal predecessors, (101), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 11:07:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2024-10-14 11:07:08,618 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 124 [2024-10-14 11:07:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:08,619 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2024-10-14 11:07:08,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2024-10-14 11:07:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:08,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:08,623 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:07:08,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -25534794, now seen corresponding path program 1 times [2024-10-14 11:07:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:08,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345672343] [2024-10-14 11:07:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:08,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:07:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:07:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:07:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:07:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:07:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:07:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:07:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345672343] [2024-10-14 11:07:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345672343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:07:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943589077] [2024-10-14 11:07:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:09,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:07:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:07:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:07:09,893 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:10,460 INFO L93 Difference]: Finished difference Result 222 states and 299 transitions. [2024-10-14 11:07:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:07:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 124 [2024-10-14 11:07:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:10,464 INFO L225 Difference]: With dead ends: 222 [2024-10-14 11:07:10,464 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 11:07:10,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:07:10,466 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:10,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 320 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:07:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 11:07:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 178. [2024-10-14 11:07:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 114 states have internal predecessors, (130), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 11:07:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 246 transitions. [2024-10-14 11:07:10,542 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 246 transitions. Word has length 124 [2024-10-14 11:07:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:10,543 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 246 transitions. [2024-10-14 11:07:10,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 246 transitions. [2024-10-14 11:07:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 11:07:10,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:10,545 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:07:10,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash -221834256, now seen corresponding path program 1 times [2024-10-14 11:07:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:10,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540781561] [2024-10-14 11:07:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:07:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:07:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:07:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:07:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:07:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:07:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-14 11:07:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540781561] [2024-10-14 11:07:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540781561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:07:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374446876] [2024-10-14 11:07:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:10,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:07:10,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:10,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:07:10,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:07:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:10,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:07:10,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-14 11:07:11,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:07:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-14 11:07:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374446876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:07:11,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:07:11,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 11:07:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599968437] [2024-10-14 11:07:11,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:07:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:07:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:07:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:07:11,329 INFO L87 Difference]: Start difference. First operand 178 states and 246 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 11:07:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:11,550 INFO L93 Difference]: Finished difference Result 338 states and 457 transitions. [2024-10-14 11:07:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:07:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-10-14 11:07:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:11,554 INFO L225 Difference]: With dead ends: 338 [2024-10-14 11:07:11,554 INFO L226 Difference]: Without dead ends: 161 [2024-10-14 11:07:11,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:07:11,561 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:11,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 83 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:07:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-14 11:07:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 75. [2024-10-14 11:07:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 11:07:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-10-14 11:07:11,606 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 125 [2024-10-14 11:07:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:11,607 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-10-14 11:07:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 11:07:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-10-14 11:07:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 11:07:11,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:11,612 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:11,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:07:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:07:11,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:11,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1031180882, now seen corresponding path program 1 times [2024-10-14 11:07:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830009161] [2024-10-14 11:07:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:07:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152244805] [2024-10-14 11:07:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:07:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:11,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:07:11,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:07:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:11,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:07:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:12,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:07:12,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:07:12,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:07:12,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 11:07:12,289 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,SelfDestructingSolverStorable5 [2024-10-14 11:07:12,293 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 11:07:12,398 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:07:12,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:07:12 BoogieIcfgContainer [2024-10-14 11:07:12,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:07:12,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:07:12,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:07:12,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:07:12,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:00" (3/4) ... [2024-10-14 11:07:12,407 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:07:12,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:07:12,410 INFO L158 Benchmark]: Toolchain (without parser) took 12881.10ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 121.8MB in the beginning and 138.2MB in the end (delta: -16.4MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,410 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:12,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.98ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 108.3MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.49ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 106.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,411 INFO L158 Benchmark]: Boogie Preprocessor took 51.98ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 103.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,413 INFO L158 Benchmark]: RCFGBuilder took 595.56ms. Allocated memory is still 163.6MB. Free memory was 103.4MB in the beginning and 124.7MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,413 INFO L158 Benchmark]: TraceAbstraction took 11822.41ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 123.9MB in the beginning and 138.2MB in the end (delta: -14.2MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. [2024-10-14 11:07:12,413 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 346.0MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:12,415 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.16ms. Allocated memory is still 104.9MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.98ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 108.3MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.49ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 106.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.98ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 103.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 595.56ms. Allocated memory is still 163.6MB. Free memory was 103.4MB in the beginning and 124.7MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11822.41ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 123.9MB in the beginning and 138.2MB in the end (delta: -14.2MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 346.0MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_8 = 1; [L25] unsigned char var_1_9 = 0; [L26] unsigned long int var_1_10 = 2; [L27] signed char var_1_11 = -16; [L28] signed char var_1_12 = -2; [L29] signed char var_1_13 = -10; [L30] signed char var_1_14 = 4; [L31] signed long int var_1_15 = 256; [L32] signed long int var_1_16 = 0; [L33] signed long int var_1_17 = 1000000000; [L34] signed long int var_1_18 = 50; [L35] signed long int var_1_19 = 9; [L36] signed long int var_1_20 = 1000000000; [L37] signed char var_1_21 = 4; [L38] unsigned short int var_1_22 = 10000; [L39] unsigned char last_1_var_1_1 = 1; [L40] signed long int last_1_var_1_15 = 256; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 [L97] last_1_var_1_15 = var_1_15 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L66] var_1_8 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L69] var_1_9 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=-10, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=4, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_14 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=0, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=1000000000, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L85] var_1_17 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_17 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_17 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=50, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L88] var_1_18 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=9, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L91] var_1_19 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L108] RET updateVariables() [L109] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=1000000000, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) [L48] var_1_20 = var_1_19 [L49] var_1_21 = 1 [L50] var_1_22 = 10 VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L51] COND TRUE (var_1_20 + (var_1_20 / var_1_16)) == var_1_20 VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=256, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L52] COND TRUE var_1_20 >= last_1_var_1_15 [L53] var_1_15 = (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=1, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L58] COND TRUE var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L59] var_1_1 = (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=17, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=0, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((((var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) ? ((var_1_20 >= last_1_var_1_15) ? (var_1_15 == ((signed long int) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((signed long int) ((((var_1_17) < ((5.75 + var_1_19))) ? (var_1_17) : ((5.75 + var_1_19))))))) : 1)) && (var_1_20 == ((signed long int) var_1_19))) && (var_1_21 == ((signed char) 1))) && (var_1_22 == ((unsigned short int) 10)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=17, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=0, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=256, last_1_var_1_1=1, var_1_10=2, var_1_11=9, var_1_12=-54, var_1_13=63, var_1_14=0, var_1_15=17, var_1_16=259, var_1_17=0, var_1_18=0, var_1_19=257, var_1_1=0, var_1_20=257, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 956 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 611 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 345 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 486 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 166 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 4121 SizeOfPredicates, 2 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 5745/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:07:12,473 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_floatingpointinfluence_no-floats_file-72.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 c59859db1de32b14e97175c7815ca7da18f68a8dcc54297861a94ac58dd03527 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:07:14,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:07:14,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:07:14,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:07:14,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:07:14,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:07:14,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:07:14,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:07:14,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:07:14,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:07:14,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:07:14,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:07:14,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:07:14,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:07:14,865 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:07:14,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:07:14,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:07:14,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:07:14,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:07:14,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:07:14,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:07:14,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:07:14,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:07:14,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:07:14,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:07:14,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:07:14,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:07:14,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:07:14,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:07:14,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:07:14,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:07:14,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:07:14,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:07:14,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:07:14,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:14,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:07:14,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:07:14,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:07:14,873 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:07:14,873 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:14,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:07:14,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:07:14,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:07:14,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:07:14,875 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:07:14,875 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 -> c59859db1de32b14e97175c7815ca7da18f68a8dcc54297861a94ac58dd03527 [2024-10-14 11:07:15,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:07:15,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:07:15,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:07:15,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:07:15,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:07:15,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:07:16,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:07:17,164 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:07:17,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:07:17,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d7d5b29/41696fd92036451db2fc3dc908fcfa94/FLAGd7d50edc5 [2024-10-14 11:07:17,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d7d5b29/41696fd92036451db2fc3dc908fcfa94 [2024-10-14 11:07:17,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:07:17,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:07:17,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:17,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:07:17,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:07:17,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9584c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17, skipping insertion in model container [2024-10-14 11:07:17,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:07:17,387 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_floatingpointinfluence_no-floats_file-72.i[916,929] [2024-10-14 11:07:17,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:17,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:07:17,501 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_floatingpointinfluence_no-floats_file-72.i[916,929] [2024-10-14 11:07:17,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:17,574 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:07:17,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17 WrapperNode [2024-10-14 11:07:17,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:17,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:17,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:07:17,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:07:17,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,634 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-10-14 11:07:17,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:17,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:07:17,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:07:17,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:07:17,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:07:17,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:07:17,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:07:17,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:07:17,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:07:17,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (1/1) ... [2024-10-14 11:07:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:17,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:17,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:07:17,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:07:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:07:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:07:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:07:17,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:07:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:07:17,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:07:17,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:07:17,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:07:28,172 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:07:28,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:07:28,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:07:28,249 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:07:28,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:28 BoogieIcfgContainer [2024-10-14 11:07:28,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:07:28,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:07:28,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:07:28,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:07:28,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:07:17" (1/3) ... [2024-10-14 11:07:28,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e40bcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:28, skipping insertion in model container [2024-10-14 11:07:28,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:17" (2/3) ... [2024-10-14 11:07:28,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e40bcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:28, skipping insertion in model container [2024-10-14 11:07:28,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:28" (3/3) ... [2024-10-14 11:07:28,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-72.i [2024-10-14 11:07:28,278 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:07:28,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:07:28,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:07:28,366 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;@7f7ac584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:07:28,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:07:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:07:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:28,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:28,386 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:28,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:28,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash -475487498, now seen corresponding path program 1 times [2024-10-14 11:07:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113726477] [2024-10-14 11:07:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:28,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:07:28,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:07:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:28,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:07:28,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-14 11:07:28,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:07:28,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113726477] [2024-10-14 11:07:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113726477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:28,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:28,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:07:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027014364] [2024-10-14 11:07:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:28,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:07:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:07:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:07:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:28,851 INFO L87 Difference]: Start difference. First operand has 49 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:33,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:33,033 INFO L93 Difference]: Finished difference Result 95 states and 171 transitions. [2024-10-14 11:07:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:07:33,077 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, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 124 [2024-10-14 11:07:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:33,083 INFO L225 Difference]: With dead ends: 95 [2024-10-14 11:07:33,083 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 11:07:33,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:33,089 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:33,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:07:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 11:07:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 11:07:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:07:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-14 11:07:33,127 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 124 [2024-10-14 11:07:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:33,128 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-14 11:07:33,128 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, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:07:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-14 11:07:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:33,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:33,134 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:33,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:07:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:33,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:33,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1800542156, now seen corresponding path program 1 times [2024-10-14 11:07:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118925969] [2024-10-14 11:07:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:33,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:33,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:07:33,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:07:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:33,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 11:07:33,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-14 11:07:35,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:07:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-14 11:07:36,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118925969] [2024-10-14 11:07:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118925969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:07:36,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:07:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 11:07:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179673900] [2024-10-14 11:07:36,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:07:36,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:07:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:07:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:07:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:07:36,732 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 11:07:42,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:46,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:50,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:50,053 INFO L93 Difference]: Finished difference Result 101 states and 148 transitions. [2024-10-14 11:07:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:07:50,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 124 [2024-10-14 11:07:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:50,107 INFO L225 Difference]: With dead ends: 101 [2024-10-14 11:07:50,107 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 11:07:50,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:07:50,109 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:50,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 83 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2024-10-14 11:07:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 11:07:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-10-14 11:07:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:07:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-10-14 11:07:50,123 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124 [2024-10-14 11:07:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:50,124 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-10-14 11:07:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 11:07:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-10-14 11:07:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 11:07:50,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:50,127 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:50,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:07:50,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:50,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:50,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -25534794, now seen corresponding path program 1 times [2024-10-14 11:07:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:50,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900151922] [2024-10-14 11:07:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:50,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:50,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:07:50,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:07:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:50,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:07:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:50,937 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-14 11:07:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc5 [1245549573] [2024-10-14 11:07:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:50,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 11:07:50,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 11:07:50,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-14 11:07:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:51,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 11:07:51,102 INFO L278 TraceCheckSpWp]: Computing forward predicates...